The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 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 Donovan Johnson, Table of n, a(n) for n = 1..500 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 Adjacent sequences:  A070167 A070168 A070169 * A070171 A070172 A070173 KEYWORD easy,nonn AUTHOR Benoit Cloitre and Labos Elemer, May 06 2002 EXTENSIONS Edited by Charles R Greathouse IV, Oct 28 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 15 01:35 EDT 2021. Contains 343909 sequences. (Running on oeis4.)