The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A061367 Composite n such that sigma(n)-phi(n) divides sigma(n)+phi(n). 2
 15, 35, 95, 119, 143, 209, 287, 319, 323, 357, 377, 527, 559, 779, 899, 923, 989, 1007, 1045, 1189, 1199, 1343, 1349, 1763, 1919, 2159, 2261, 2507, 2639, 2759, 2911, 3239, 3339, 3553, 3599, 3827, 4031, 4147, 4607, 5049, 5183, 5207, 5249, 5459, 5543, 6439 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Primes trivially satisfy the defining condition. LINKS Amiram Eldar, Table of n, a(n) for n = 1..10000 FORMULA It seems that a(n) is asymptotic to c*n^2, 22*n^2. - Benoit Cloitre, Sep 17 2002 EXAMPLE sigma(15)-phi(15) = 24-8 = 16 divides sigma(15)-phi(15)=24+8 = 32, so 15 is a term of the sequence. MATHEMATICA f[n_] := Module[{a = DivisorSigma[1, n], b = EulerPhi[n]}, Mod[(a + b), (a - b)] == 0]; Select[Range[2, 10^4], (f[ # ] && ! PrimeQ[ # ]) &] CROSSREFS Cf. A051612, A065387. Sequence in context: A109068 A334309 A238232 * A070161 A142591 A321617 Adjacent sequences: A061364 A061365 A061366 * A061368 A061369 A061370 KEYWORD nonn AUTHOR Joseph L. Pe, Feb 13 2002 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.

Last modified June 20 19:46 EDT 2024. Contains 373532 sequences. (Running on oeis4.)