login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A070171
Numbers k such that sigma(phi(k)) = k-phi(k).
1
2, 18, 84, 15210, 15216, 66720, 2858880, 62905344, 358313760, 3633603510
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