%I #13 Aug 19 2016 04:31:59
%S 0,1,1,5,2,11,2,19,3,27,3,36,3,47,4,58,4,70,4,83,4,96,5,110,5,125,5,
%T 140,5,156,5,173,6,190,6,207,6,225,6,244,6,263,6,282,7,302,7,322,7,
%U 343,7,364,7,386,7,408,7,430,8,453,8,476,8,500,8,524,8,548,8,573,8,598,8,624,9,650
%N Modified juggler sequence: if n mod 2 = 0 then round(sqrt(n)) else round(n^(3/2)).
%D C. Pickover, Computers and the Imagination, St. Martin's Press, NY, 1991, p. 233.
%H Chai Wah Wu, <a href="/A094685/b094685.txt">Table of n, a(n) for n = 0..10000</a>
%H H. J. Smith, <a href="http://harry-j-smith-memorial.com/Juggler/JuggWhat.html">Juggler Sequence</a>
%p f:=proc(n) if n mod 2 = 0 then RETURN(round(sqrt(n))) else RETURN(round(n^(3/2))); fi; end;
%o (Python)
%o from gmpy2 import isqrt_rem
%o def A094685(n):
%o i, j = isqrt_rem(n**3 if n % 2 else n)
%o return int(i+ int(4*(j-i) >= 1)) # _Chai Wah Wu_, Aug 17 2016
%Y Cf. A007320, A007321, A094684, A094683, A094693, A094725.
%K nonn
%O 0,4
%A _N. J. A. Sloane_, Jun 09 2004