The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065986 Numbers n such that Sigma(n) = EulerPhi(n+1) + EulerPhi(n) + EulerPhi(n-1). 1
6, 147, 286, 376, 534, 738, 805, 2392, 2406, 4324, 8214, 9606, 10362, 12126, 16263, 17511, 27639, 29151, 39215, 48616, 60687, 61132, 61915, 141526, 142610, 147890, 153530, 160748, 189501, 212134, 221121, 253022, 324650, 326691, 368296, 404716, 453699 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Jon E. Schoenfield, Table of n, a(n) for n = 1..80 (first 60 terms from Harry J. Smith)
EXAMPLE
Sigma(6) = 12 = 6 + 2 + 4 = EulerPhi(7) + EulerPhi(6) + EulerPhi(5).
MATHEMATICA
Select[Range@500000, EulerPhi@(# + 1) + EulerPhi@(#) + EulerPhi@(# - 1) == DivisorSigma[1, #] &] (* Vincenzo Librandi, Jun 17 2018 *)
PROG
(PARI) { n=e1=e2=0; for (m=2, 10^9, e2=e1; e1=e; e=eulerphi(m+1); if (sigma(m) == e + e1 + e2, write("b065986.txt", n++, " ", m); if (n==1000, return)) ) } \\ Harry J. Smith, Nov 05 2009
(Magma) [n: n in [2..10^6] | EulerPhi(n+1)+EulerPhi(n)+ EulerPhi(n-1) eq SumOfDivisors(n)]; // Vincenzo Librandi, Jun 17 2018
CROSSREFS
Cf. A000010.
Sequence in context: A250389 A358800 A063419 * A199226 A012791 A347842
KEYWORD
nonn
AUTHOR
Joseph L. Pe, Dec 10 2001
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 17 12:10 EDT 2024. Contains 372600 sequences. (Running on oeis4.)