Collatz Conjecture Explorer

Start with a positive integer n. If n is even, go to n/2. If odd, go to 3n + 1. The conjecture claims every starting value eventually reaches 1.

Starting value (positive integer)

Show full sequence (can be long)

Max iterations (safety limit)

Compact output (wrap lines)

Actions

Run Random (1–1,000,000) Clear

Copy sequence Export CSV

Stopping time (steps to 1)

--

Peak value reached

--

Odd steps

--

Even steps

--

Trajectory Plot (value vs. step)

Log scale (Y) Show dots

Tip: Use Log scale when the peak is very large; it makes structure easier to see.

---

Range Explorer

Explore a whole range 1…N (uses JavaScript Numbers for speed; limited to safe sizes). Finds the starting value with the longest stopping time and the highest peak.

N (range is 1…N)

Tip: 10,000 is quick; 100,000 may be slower depending on device/browser.

Max iterations per start (safety limit)

Actions

Analyze range Clear

Longest stopping time

--

Starting value (longest)

--

Highest peak

--

Starting value (peak)

--

Metric	Value
Range analyzed	--
Safety limit hit?	--
Memoization entries	--