OFFSET
1,1
COMMENTS
Used sigma(n)-n, namely the sum of proper divisors.
LINKS
Donovan Johnson, Table of n, a(n) for n = 1..100
MAPLE
with(numtheory); P:=proc(n) local i, j, k; for i from 1 by 1 to n do j:=sigma(phi(i))-phi(i); k:=phi(sigma(i)-i); if j=k then print(i); fi; od; end: P(150000);
MATHEMATICA
Select[Range[2600000], DivisorSigma[1, EulerPhi[#]]-EulerPhi[#]==EulerPhi[ DivisorSigma[1, #]-#]&] (* Harvey P. Dale, Mar 24 2016 *)
PROG
(PARI) isA132793(n)={ if( sigma(eulerphi(n))-eulerphi(n) == eulerphi(sigma(n)-n), 1, 0 ) ; }
{ for(n=2, 6000000, if(isA132793(n), print1(n, ", ") ; ) ; ) ; } \\ R. J. Mathar, Nov 11 2007
CROSSREFS
KEYWORD
nonn
AUTHOR
Paolo P. Lava and Giorgio Balzarotti, Aug 31 2007
EXTENSIONS
More terms from R. J. Mathar, Nov 11 2007
Invalid first term removed by Donovan Johnson, Sep 11 2013
STATUS
approved