OFFSET
1,3
COMMENTS
It is not known if every starting value eventually reaches 1.
REFERENCES
C. Pickover, Computers and the Imagination, St. Martin's Press, NY, 1991, p. 232.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Giovanni Resta, Table of n, a(n) for n = 1..10000
H. J. Smith, Juggler Sequence
Eric Weisstein's World of Mathematics, Juggler Sequence
Wikipedia, Juggler sequence
R. G. Wilson, V, Letter to N. J. A. Sloane, Sep. 1992
EXAMPLE
The trajectory of 1 is 3, 5, 11, 36, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ... so a(3) = 6.
MAPLE
A007320 := proc(n)
local a, ntrack;
a := 0 ;
ntrack := n ;
while ntrack > 1 do
ntrack := A094683(ntrack) ;
a := a+1 ;
end do:
return a;
end proc: # R. J. Mathar, Apr 19 2013
MATHEMATICA
js[n_] := If[ EvenQ[n], Floor[ Sqrt[n]], Floor[ Sqrt[n^3]]]; f[n_] := Length[ NestWhileList[js, n, # != 1 &]] - 1; Table[ f[n], {n, 99}] (* Robert G. Wilson v, Jun 10 2004 *)
CROSSREFS
KEYWORD
nonn
EXTENSIONS
Corrected and extended by Jason Earls, Jun 09 2004
STATUS
approved