|
Search: id:A007321
|
|
|
| A007321 |
|
Number of steps needed for modified juggler sequence (A094685) started at n to reach 1.
(Formerly M4048)
|
|
+0
9
|
|
| 0, 1, 6, 2, 5, 2, 13, 7, 10, 7, 4, 7, 6, 3, 9, 3, 9, 3, 12, 3, 9, 6, 9, 6, 19, 6, 9, 6, 9, 6, 16, 3, 5, 3, 8, 3, 16, 3, 5, 3, 14, 3, 11, 14, 11, 14, 5, 14, 14, 14, 14, 14, 5, 14, 5, 14, 11, 8, 11, 8, 8, 8, 8, 8, 11, 8, 11, 8, 8, 8, 8, 8, 21, 11, 21, 11, 8, 11, 8, 11, 19, 11, 11, 11, 8, 11, 11, 11, 11
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
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. 233.
|
|
LINKS
|
Richard J Mathar, Table of n, a(n) for n = 1..836
H. J. Smith, Juggler Sequence
|
|
MAPLE
|
f:=proc(n) if n mod 2 = 0 then RETURN(round(sqrt(n))) else RETURN(round(n^(3/2))); fi; end; [Corrected by Richard J Mathar, Jul 28 2007]
|
|
MATHEMATICA
|
mjs[n_] := If[EvenQ[n], Round[Sqrt[n]], Round[Sqrt[n^3]]]; f[n_] := Length[NestWhileList[mjs, n, # != 1 &]] - 1; Table[ f[n], {n, 90}]
|
|
CROSSREFS
|
Cf. A094685, A007320, A094683.
Adjacent sequences: A007318 A007319 A007320 this_sequence A007322 A007323 A007324
Sequence in context: A033939 A021020 A007320 this_sequence A062828 A124457 A063720
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas, Robert G. Wilson v (rgwv(AT)rgwv.com), Mira Bernstein (mira(AT)math.berkeley.edu)
|
|
EXTENSIONS
|
More terms from njas, Jun 09, 2004.
|
|
|
Search completed in 0.002 seconds
|
