Collatz Inverse Tree Map - 2D Radial Tree

Grow the tree of all integers that reach 1 in d steps: radius is the step count, violet branches are the (m-1)/3 predecessors.

Switch to 3D

Presets

Playback

Tree

Depth is the number of steps counted back from 1; trace shows where a chosen n enters the tree.

Colouring

What the edges show.

Layers

Model checks

The science

The 3n+1 rule

Start from any positive integer n. If it is even, halve it; if it is odd, replace it by 3n + 1. The Collatz conjecture says every start eventually reaches 1. It has been verified by computer for every start up to roughly 268, but it is unproven: nobody knows whether some start escapes to infinity or falls into another cycle. Nothing on this page proves anything; it measures how the sequences behave.

Why the tree has so few branches

Every odd step multiplies the value by about 3 (+1 changes little) and every halving divides by 2, so exactly: log2 n + Σodd a log2(3 + 1/a) = (number of halvings). That identity is checked on every lane. If odd and even steps occurred like coin tosses, one shortcut step (n/2 or (3n+1)/2) would change ln n by ½ln(3/2) + ½ln(1/2) = ½ln(3/4) = −0.144, giving about 6.95 ln n shortcut steps, i.e. 10.43 ln n standard steps, and a long-run odd share of 1/(1 + log23) = 0.387. The measured averages follow this heuristic to a few percent, but the heuristic is a statistical model, not a proof.

Honest simplifications: heights are drawn on a log2 scale so peaks of 106 stay visible; each lane is exact integer arithmetic (values stay below 253 for n ≤ 10000); beads move at constant speed along the polyline, not at physical times. Hailstone is only the nickname: the numbers rise and fall like a hailstone in a cloud, they do not model weather.

What to try
  • Grow the tree to depth 20: most numbers have exactly one predecessor (2m); a violet branch appears only at m = 4 mod 6.
  • Switch the layer to Residue mod 3: multiples of 3 (red) never get a violet branch, so they always end a chain.
  • Trace n = 27: its last steps funnel into 1 through the tree; the rest of its 111-step path lies far beyond depth 40.
  • Click any bead: the gold line is the entire forward Collatz path of that integer back to 1.
  • On the right-hand scatter plot, the cyan cloud of stopping times shows why trees of depth 40 contain only the tiny first layer of the integers.
Forward path of the selected / traced n
Integers per tree level
Stopping time of every n up to 2000
Made with 🟠 Blender