A061367 Composite n such that sigma(n)-phi(n) divides sigma(n)+phi(n).

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

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, 2<c<2.5 and that a(n)>2*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