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!)
 A136041 Largest prime p such that phi^n(p) = 2, where phi^n means n iterations of Euler's totient function. 0
 3, 7, 19, 43, 163, 487, 1459, 3079, 8803, 39367, 78787, 196831, 581743, 2125819, 6381667, 19131877, 86093443, 258280327, 516560659, 1214874127 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The largest prime in row n+1 of A058812. From Shapiro, we know that a(n) <= 1 + 2*3^(n-1). This bound is attained for n=1,2,3,5,6,7,17,18,.., which is n=A003306(k)+1 for k=1,2,3,... LINKS Harold Shapiro, An arithmetic function arising from the phi function, Amer. Math. Monthly, Vol. 50, No. 1 (1943), 18-30. MATHEMATICA nn=20; pk=Table[0, {nn}]; Do[p=Prime[n]; k=Length[NestWhileList[EulerPhi, p, #>2&]]-1; If[0

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 May 30 05:08 EDT 2020. Contains 334712 sequences. (Running on oeis4.)