How to Use
Enter n:
- Sequence: Iterated s(n)
- Type: Terminates, cycles, or unknown
- Length: Steps to termination
Sequence Types
- Terminates at 0: most numbers
- Fixed point: perfect numbers (6,28,496)
- 2-cycle: amicable pairs (220↔284)
- k-cycle: sociable numbers
Open Problems
The Catalan-Dickson conjecture says all sequences eventually terminate or cycle. The sequence starting at 276 has been computed for billions of terms without resolving. Five 'driver' sequences (276, 552, 564, 660, 966) remain open.
Step-by-Step Instructions
- 1Enter n.
- 2View sequence.
- 3Classify behavior.
- 4See trajectory.
- 5Check perfect/amicable.