|
Search: id:A078767
|
|
|
| A078767 |
|
Let f(n) = A003434(n) be the number of iterations of phi needed to reach 1. Then a(n) = max(f(1), f(2), ..., f(n)). |
|
+0
1
|
|
| 0, 1, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
PROGRAM
|
(PARI) epr(m, c)=if (c>0, m=eulerphi(m); c--; epr(m, c), m) x=1; for (n=1, 100, while (epr(n, x)>1, x++); print1(x", "))
|
|
CROSSREFS
|
Sequence in context: A071578 A157791 A156874 this_sequence A093125 A156081 A105047
Adjacent sequences: A078764 A078765 A078766 this_sequence A078768 A078769 A078770
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jon Perry (perry(AT)globalnet.co.uk), Jan 09 2003
|
|
EXTENSIONS
|
Description corrected by Mark Hudson (mrmarkhudson(AT)hotmail.com), Jan 31 2003
|
|
|
Search completed in 0.002 seconds
|
