OFFSET
1,2
COMMENTS
If 2^p-1 is prime (a Mersenne prime) and n = 2^p*(2^p-1) then n is in the sequence because 3*n-2*phi(n) = 3*2^p*(2^p-1)-2^p*(2^p-2) = 2^p*(2^(p+1)-1) = sigma(2^p-1)*sigma(2^p) = sigma(2^p*(2^p-1)) = sigma(n). - Farideh Firoozbakht, Dec 31 2005
MATHEMATICA
Select[Range[10^6], DivisorSigma[1, #] == 3*# - 2*EulerPhi[#] &] (* Amiram Eldar, May 14 2022 *)
PROG
(PARI) for(n=1, 500000, if(sigma(n)==3*n-2*eulerphi(n), print1(n, ", ")))
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Mar 03 2002
EXTENSIONS
More terms (complete up to 50000000). - Rick L. Shepherd, Mar 28 2002
More terms from Labos Elemer, Apr 03 2002
a(24)-a(30) from Donovan Johnson, Feb 08 2012
STATUS
approved
