OFFSET
1,2
LINKS
Georg Fischer, Table of n, a(n) for n = 1..2000 (first 1835 terms by Marius A. Burtea)
MATHEMATICA
Select[Range[1300], GCD[#, EulerPhi[#]] == DivisorSigma[0, #] &] (* Jayanta Basu, Mar 21 2013 *)
PROG
(PARI) for(n=1, 1592, if(gcd(n, eulerphi(n))==numdiv(n), print1(n, ", ")))
(Magma) [n: n in [1..2000] | GCD(n, EulerPhi(n)) eq NumberOfDivisors(n) ]; // Marius A. Burtea, Dec 28 2018
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Apr 30 2002
STATUS
approved