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”).

A070170
Numbers n such that sigma(n-phi(n)) = phi(n).
2
2, 15, 39, 255, 627, 939, 1431, 1581, 2409, 3459, 4797, 14289, 20619, 30987, 31935, 43791, 57291, 68991, 71193, 73749, 74841, 94671, 120669, 121227, 132297, 148161, 162843, 196449, 200787, 209451, 217191, 302907, 308937, 434733, 439959, 455961, 466701, 467109
OFFSET
1,1
COMMENTS
All terms 2 < a(n) < 20000000 are odd and divisible by 3. Most are squarefree.
From numerical observation if n>31 : log(n)^10 < a(n) < log(n)^11.
LINKS
MATHEMATICA
Do[s=DivisorSigma[1, (n-EulerPhi[n])]-EulerPhi[n]; If[Equal[s, 0], Print[n]], {n, 1, 2000000}]
PROG
(PARI) for(n=2, 2000000, if(sigma(n-eulerphi(n))==eulerphi(n), print1(n, ", ")))
CROSSREFS
Cf. A070171.
Sequence in context: A214541 A180223 A070009 * A033568 A200156 A249997
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre and Labos Elemer, May 06 2002
EXTENSIONS
Edited by Charles R Greathouse IV, Oct 28 2009
STATUS
approved