|
|
A185816
|
|
Number of iterations of lambda(n) needed to reach 1.
|
|
6
|
|
|
0, 1, 2, 2, 3, 2, 3, 2, 3, 3, 4, 2, 3, 3, 3, 3, 4, 3, 4, 3, 3, 4, 5, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 3, 3, 4, 4, 3, 3, 4, 3, 4, 4, 3, 5, 6, 3, 4, 4, 4, 3, 4, 4, 4, 3, 4, 4, 5, 3, 4, 4, 3, 4, 3, 4, 5, 4, 5, 3, 4, 3, 4, 4, 4, 4, 4, 3, 4, 3, 5, 4, 5, 3, 4, 4, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
lambda(n) is the Carmichael lambda function, A002322.
|
|
LINKS
|
Paul Erdős, A. Granville, C. Pomerance, and C. Spiro, On the Normal Behavior of the Iterates of some Arithmetic Functions, in Analytic number theory (Allerton Park, IL, 1989), Progr. Math., 85 Birkhäuser Boston, Boston, MA, (1990), 165-204.
|
|
FORMULA
|
|
|
EXAMPLE
|
If n = 23 the trajectory is 23, 22, 10, 4, 2, 1. Its length is 6, thus a(23) = 5.
|
|
MAPLE
|
a:= n-> `if`(n=1, 0, 1+a(numtheory[lambda](n))):
|
|
MATHEMATICA
|
f[n_] := Length[ NestWhileList[ CarmichaelLambda, n, Unequal, 2]] - 2; Table[f[n], {n, 1, 120}]
|
|
PROG
|
(Haskell)
a185816 n = if n == 1 then 0 else a185816 (a002322 n) + 1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|