Multiply primes down a path and you get a single number back —
but not just any number. Factor it, sort the pieces, and it
tells you the exact route it took to get there. Click +
to grow the tree below, click a node to watch its address decode.
child(n, k) = n × nextPrimek(lpf(n))·k = how many children the node already has
Interactive tree
Root is always 2. Every other node's address is its parent's address × one prime.