TOPICS
Search

Juggler Sequence


Define the juggler sequence for a positive integer a_1=n as the sequence of numbers produced by the iteration

 a_(k+1)={|_a_k^(1/2)_|   for even a_k; |_a_k^(3/2)_|   for odd a_k,
(1)

where |_x_| denotes the floor function. For example, the sequence produced starting with the number 77 is 77, 675, 17537, 2322378, 1523, 59436, 243, 3787, 233046, 482, 21, 96, 9, 27, 140, 11, 36, 6, 2, 1.

JugglerNumber

Rather surprisingly, all integers appear to eventually reach 1, a conjecture that holds at least up to 10^6 (E. W. Weisstein, Jan. 23, 2006). The numbers of steps l(n) needed to reach 1 for starting values of n=1, 2, ... are 0, 1, 6, 2, 5, 2, 4, 2, 7, 7, 4, 7, 4, 7, 6, 3, 4, 3, 9, 3, ... (OEIS A007320), plotted above. The high-water marks for numbers of steps are 0, 1, 6, 7, 9, 11, 17, 19, 43, 73, 75, 80, 88, 96, 107, 131, ... (OEIS A095908), which occur for starting values of 1, 2, 3, 9, 19, 25, 37, 77, 163, 193, 1119, ... (OEIS A094679).

The smallest integers requiring n steps to reach 1 for n=1, 2, ... are 1, 2, 4, 16, 7, 5, 3, 9, 33, 19, 81, 25, 353, ... (OEIS A094670).


See also

Collatz Problem, Juggling

Explore with Wolfram|Alpha

References

Pickover, C. A. Computers and the Imagination. New York: St. Martin's Press, p. 232, 1991.Pickover, C. A. "Juggler Numbers." Ch. 45 in The Mathematics of Oz: Mental Gymnastics from Beyond the Edge. New York: Cambridge University Press, pp. 102-106 and 301-304, 2002.Sloane, N. J. A. Sequences A007320, A094679, A095908, and A094670 in "The On-Line Encyclopedia of Integer Sequences."

Referenced on Wolfram|Alpha

Juggler Sequence

Cite this as:

Weisstein, Eric W. "Juggler Sequence." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/JugglerSequence.html

Subject classifications