OFFSET
1,2
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..72
MATHEMATICA
Do[ If[ Mod[ EulerPhi[ Prime[n] + 1], n] == 0, Print[n]], {n, 1, 10^7} ]
PROG
(PARI) isok(k) = (eulerphi(prime(k)+1) % k) == 0; \\ Michel Marcus, Feb 17 2021
(PARI) list(lim) = my(k = 0); forprime(p = 1, lim, k++; if(!(eulerphi(p+1) % k), print1(k, ", "))); \\ Amiram Eldar, Apr 25 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Feb 05 2002
EXTENSIONS
Edited and extended by Robert G. Wilson v, Feb 07 2002
STATUS
approved
