|
|
A070171
|
|
Numbers k such that sigma(phi(k)) = k-phi(k).
|
|
1
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Apart from the first term, all elements are composite. So far all terms beyond the first are divisible by 6.
|
|
LINKS
|
|
|
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=", ")
|
|
CROSSREFS
|
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|