login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A095398 Number of steps required to reach 1 for iterated modified juggler map of A095396. 1
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, 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, 8, 14, 10, 12, 10, 12, 10, 12, 10, 12, 10, 14, 10, 12, 12, 16, 12, 18, 12, 18, 10, 12, 10, 16 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Parallel to A007320.

LINKS

Table of n, a(n) for n=1..81.

EXAMPLE

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.

MATHEMATICA

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}]

Table[Length[NestWhileList[If[EvenQ[#], Floor[#^(2/3)], Floor[#^(3/2)]]&, n, #!=1&]]-1, {n, 90}] (* Harvey P. Dale, Dec 28 2018 *)

CROSSREFS

Cf. A007320, A094683, A094716, A095396, A097397.

Sequence in context: A228045 A011361 A199433 * A073330 A208852 A248284

Adjacent sequences:  A095395 A095396 A095397 * A095399 A095400 A095401

KEYWORD

nonn

AUTHOR

Labos Elemer, Jun 18 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 22 12:27 EDT 2019. Contains 326177 sequences. (Running on oeis4.)