|
%I M4048 #30 Mar 03 2019 14:41:31
%S 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,
%T 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,
%U 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
%N Number of steps needed for modified juggler sequence (A094685) started at n to reach 1.
%C It is not known if every starting value eventually reaches 1.
%D C. Pickover, Computers and the Imagination, St. Martin's Press, NY, 1991, p. 233.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Richard J Mathar and Chai Wah Wu, <a href="/A007321/b007321.txt">Table of n, a(n) for n = 1..10000</a> n = 1..836 from Richard J Mathar
%H H. J. Smith, <a href="http://harry-j-smith-memorial.com/Juggler/JuggWhat.html">Juggler Sequence</a>
%H R. G. Wilson, V, <a href="/A007320/a007320.pdf">Letter to N. J. A. Sloane, Sep. 1992</a>
%p f:=proc(n) if n mod 2 = 0 then RETURN(round(sqrt(n))) else RETURN(round(n^(3/2))); fi; end; # corrected by _R. J. Mathar_, Jul 28 2007
%t 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}]
%Y Cf. A094685, A007320, A094683.
%K nonn,easy
%O 1,3
%A _N. J. A. Sloane_, _Robert G. Wilson v_, _Mira Bernstein_
%E More terms from _N. J. A. Sloane_, Jun 09 2004
|
