|
| |
|
|
A061367
|
|
Composite n such that sigma(n)-phi(n) divides sigma(n)+phi(n).
|
|
0
| |
|
|
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; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Primes trivially satisfy the defining condition.
|
|
|
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 (benoit7848c(AT)orange.fr), 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
| Sequence in context: A098271 A082663 A109068 * A070161 A142591 A074480
Adjacent sequences: A061364 A061365 A061366 * A061368 A061369 A061370
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Feb 13 2002
|
| |
|
|
