Juggler sequence
In recreational mathematics a juggler sequence is an integer sequence that starts with a positive integer a0, with each subsequent term in the sequence defined by the recurrence relation:
Juggler sequences were publicised by American mathematician and author Clifford A. Pickover. The name is derived from the rising and falling nature of the sequences, like balls in the hands of a juggler.
For example, the juggler sequence starting with a0 = 3 is
If a juggler sequence reaches 1, then all subsequent terms are equal to 1. It is conjectured that all juggler sequences eventually reach 1. This conjecture has been verified for initial terms up to 106, but has not been proved. Juggler sequences therefore present a problem that is similar to the Collatz conjecture, about which Paul Erdős stated that "mathematics is not yet ready for such problems".
For a given initial term n, one defines l(n) to be the number of steps which the juggler sequence starting at n takes to first reach 1, and h(n) to be the maximum value in the juggler sequence starting at n. For small values of n we have:
(sequence in the OEIS)
(sequence in the OEIS)
Juggler sequences can reach very large values before descending to 1. For example, the juggler sequence starting at a0 = 37 reaches a maximum value of 24906114455136. Harry J. Smith has determined that the juggler sequence starting at a0 = 48443 reaches a maximum value at a60 with 972,463 digits, before reaching 1 at a157.
...
Wikipedia