|
|
A215240
|
|
Sum of the numbers p such that phi(p) = n, where phi is Euler's totient function.
|
|
4
|
|
|
3, 13, 0, 35, 0, 48, 0, 105, 0, 33, 0, 166, 0, 0, 0, 231, 0, 138, 0, 218, 0, 69, 0, 621, 0, 0, 0, 87, 0, 93, 0, 581, 0, 0, 0, 655, 0, 0, 0, 833, 0, 276, 0, 299, 0, 141, 0, 1514, 0, 0, 0, 159, 0, 243, 0, 377, 0, 177, 0, 1114, 0, 0, 0, 1315, 0, 201, 0, 0, 0, 213, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
These terms (greater than 0) are not unique. The first duplicate appears at a(256) = a(2236) = 6711.
|
|
LINKS
|
D. Bressoud, CNT.m Computational Number Theory Mathematica package.
|
|
MATHEMATICA
|
Needs["CNT`"]; Table[Total[PhiInverse[n]], {n, 100}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|