|
Search: id:A055464
|
|
|
| A055464 |
|
Numbers n such that sum of EulerPhi and DivisorSum is an integer multiple of the number of divisors. |
|
+0
1
|
|
| 1, 2, 3, 4, 5, 7, 11, 13, 15, 17, 19, 21, 23, 25, 29, 30, 31, 33, 35, 37, 39, 41, 43, 45, 47, 48, 49, 51, 53, 55, 56, 57, 59, 61, 65, 67, 69, 70, 71, 73, 77, 78, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 102, 103, 105, 107, 109, 110, 111, 113, 115, 119, 121, 123
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Makowski proved that Phi[n]+Sigma[n] = nd[n] iff n is a prime (see in Sivaramakrishnan,Chapter I, page 8, Theorem 3)
|
|
REFERENCES
|
Sivaramakrishnan,R.(1989):Classical Theory of Arithmetical Functions Marcel Dekker,Inc., New York-Basel.
|
|
FORMULA
|
Solutions to Phi[x]+Sigma[x] = kd[x] or A000203(n)+A000010(n) = k*A000005(n), where k is integer.
|
|
EXAMPLE
|
It is true for all primes and some composites. n = 99, 6 divisors, Sigma = 156, Phi = 60, 156+60 = 216 = 6*36, k = 36
|
|
CROSSREFS
|
Sequence in context: A130080 A001729 A001087 this_sequence A139316 A062972 A036844
Adjacent sequences: A055461 A055462 A055463 this_sequence A055465 A055466 A055467
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Jun 27 2000
|
|
|
Search completed in 0.002 seconds
|
