This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A095398 #6 Dec 28 2018 14:09:41
%S A095398 0,1,7,2,6,8,10,3,7,3,5,7,9,7,9,9,11,9,11,11,13,11,13,4,10,4,6,8,10,8,
%T A095398 10,4,8,4,8,4,12,6,12,6,8,8,12,8,12,8,10,10,14,10,12,10,14,8,12,8,10,
%U A095398 8,14,10,12,10,12,10,12,10,12,10,14,10,12,12,16,12,18,12,18,10,12,10,16
%N A095398 Number of steps required to reach 1 for iterated modified juggler map of A095396.
%C A095398 Parallel to A007320.
%e A095398 n=37: the trajectory is {37, 225, 3375, 196069, 86818724, 196068, 3374, 224, 36, 10, 4, 2, 1}, number of required steps is a[37]=13-1=12.
%t A095398 d[x_]:=d[x]=(1-Mod[x, 2])*Floor[N[x^(2/3), 50]] +Mod[x, 2]*Floor[N[x^(3/2), 50]];d[1]=1; fd[x_]:=Delete[FixedPointList[d, x], -1] Table[Max[fd[w]], {w, 1, m}]
%t A095398 Table[Length[NestWhileList[If[EvenQ[#],Floor[#^(2/3)],Floor[#^(3/2)]]&, n, #!=1&]]-1,{n,90}] (* _Harvey P. Dale_, Dec 28 2018 *)
%Y A095398 Cf. A007320, A094683, A094716, A095396, A097397.
%K A095398 nonn
%O A095398 1,3
%A A095398 _Labos Elemer_, Jun 18 2004