OFFSET
1,1
COMMENTS
Apart from the first term, all elements are composite. So far all terms beyond the first are divisible by 6.
MATHEMATICA
Do[s=DivisorSigma[1, EulerPhi[n]]-(n-EulerPhi[n]); If[Equal[s, 0], Print[n]], {n, 1, 2000000}]
PROG
(PARI) for(n=2, 2000000, if(sigma(eulerphi(n))==n-eulerphi(n), print1(n, ", ")))
(Python)
from sympy import divisor_sigma as sigma, totient as phi
def aupto(limit):
for k in range(1, limit):
if sigma(phi(k), 1) == k - phi(k): print(k, end=", ")
aupto(2*10**4) # Michael S. Branicky, Feb 18 2021
CROSSREFS
KEYWORD
more,nonn
AUTHOR
Benoit Cloitre and Labos Elemer, May 06 2002
EXTENSIONS
a(8)-a(9) from Charles R Greathouse IV, May 02 2011
a(10) from Donovan Johnson, May 03 2011
STATUS
approved