The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A259847 Number of steps to get from n to 1 by process of replacing with the Carmichael function lambda if the result is odd, or dividing by 2 if even. 0
 0, 1, 2, 2, 3, 3, 4, 3, 4, 4, 5, 4, 5, 5, 3, 4, 5, 5, 6, 5, 4, 6, 7, 5, 6, 6, 6, 6, 7, 4, 5, 5, 5, 6, 5, 6, 7, 7, 5, 6, 7, 5, 6, 7, 5, 8, 9, 6, 6, 7, 5, 7, 8, 7, 6, 7, 6, 8, 9, 5, 6, 6, 4, 6, 5, 6, 7, 7, 7, 6, 7, 7, 8, 8, 6, 8, 5, 6, 7, 7, 8, 8, 9, 6, 5, 7, 7 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS EXAMPLE a(19)= 6 because 19 -> lambda(19)= 18 -> 9 -> lambda(9)= 6 -> 3 -> lambda(3)= 2 -> 1, hence the trajectory {19 -> 18 -> 9 -> 6 -> 3 -> 2 -> 1} with 6 iterations. MATHEMATICA f[n_]:=Module[{a=n, k=0}, While[a!=1, k++; If[EvenQ[a], a=a/2, a=CarmichaelLambda[a]]]; k]; Table[f[n], {n, 1, 150}] CROSSREFS Cf. A002322. Sequence in context: A208280 A139141 A122953 * A259103 A128998 A137813 Adjacent sequences:  A259844 A259845 A259846 * A259848 A259849 A259850 KEYWORD nonn,easy AUTHOR Michel Lagneau, Jul 07 2015 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.

Last modified February 25 10:47 EST 2020. Contains 332228 sequences. (Running on oeis4.)