%I A007321 M4048
%S A007321 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,
%T A007321 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,
%U A007321 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 A007321 Number of steps needed for modified juggler sequence (A094685) started 
               at n to reach 1.
%C A007321 It is not known if every starting value eventually reaches 1.
%D A007321 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A007321 C. Pickover, Computers and the Imagination, St. Martin's Press, NY, 1991, 
               p. 233.
%H A007321 Richard J Mathar, <a href="b007321.txt">Table of n, a(n) for n = 1..836</
               a>
%H A007321 H. J. Smith, <a href="http://harry-j-smith.com/hjsmithh/Juggler/JuggWhat.html">
               Juggler Sequence</a>
%p A007321 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]
%t A007321 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 A007321 Cf. A094685, A007320, A094683.
%Y A007321 Sequence in context: A033939 A021020 A007320 this_sequence A062828 A124457 
               A063720
%Y A007321 Adjacent sequences: A007318 A007319 A007320 this_sequence A007322 A007323 
               A007324
%K A007321 nonn,easy
%O A007321 1,3
%A A007321 N. J. A. Sloane (njas(AT)research.att.com), Robert G. Wilson v (rgwv(AT)rgwv.com), 
               Mira Bernstein (mira(AT)math.berkeley.edu)
%E A007321 More terms from N. J. A. Sloane (njas(AT)research.att.com), Jun 09, 2004.