|
|
A131263
|
|
Numbers k such that k divides 2^9 + 3^9 + 5^9 + ... + prime(k)^9.
|
|
2
|
|
|
1, 281525, 1011881, 13721649, 309777093, 417800903, 12252701193, 27377813605, 37762351523, 245773819141, 51230573255953, 82578361848569, 277900491430385
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
s = 0; Do[s = s + Prime[n]^9; If[ Mod[s, n] == 0, Print[n]], {n, 1100000}]
|
|
PROG
|
|
|
CROSSREFS
|
Cf. A085450 (smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n).
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|