A066422 a(n) = least k such that phi^(k)(n) + 1 is prime, where phi^(k) denotes application of phi k times.

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 1, 1, 2, 1, 1, 3, 1, 3, 1, 1, 1, 3, 1, 1, 1, 1, 3, 3, 1, 1, 1, 1, 3, 2, 3, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 1, 2, 4, 3, 1, 3, 1, 1, 1, 1, 1, 3, 1, 2

Offset

1,15

Links

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

Example

EulerPhi(EulerPhi(15)) + 1 = EulerPhi(8) + 1 = 4 + 1 = 5, a prime; so a(15) = 2.

Prog

(PARI) a(n) = {nb = 1; n = eulerphi(n); while(! isprime(n+1), n = eulerphi(n); nb ++; ); return (nb); } \\ Michel Marcus, May 18 2013

Crossrefs

Cf. A000010.

Sequence in context: A140500 A156054 A030616 * A274888 A239702 A202084

Adjacent sequences: A066419 A066420 A066421 * A066423 A066424 A066425

Keyword

nonn

Author

Joseph L. Pe, Dec 26 2001

Extensions

Corrected and extended by Michel Marcus, May 18 2013

Status

approved