|
|
A128169
|
|
Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^5 = 1 + A122103(k).
|
|
13
|
|
|
1, 2, 4, 6, 10, 12, 22, 58, 155, 363, 464, 665, 1146, 2870, 3048, 4019, 5931, 8724, 21503, 50439, 67560, 476281, 705570, 4050684, 6956459, 7443590, 10449928, 10799546, 15385564, 17735139, 83325458, 245271750, 255583775, 1395860516, 2921734534, 6255577368, 9050771725, 12062893218, 13689205205, 42254229197, 46440930382
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
p = 2; k = 0; s = 1; lst = {}; While[k < 521330000, s = s + p^5; If[Mod[s, ++k] == 0, AppendTo[lst, k]; Print[{k, p}]]; p = NextPrime@ p]
|
|
CROSSREFS
|
Cf. A085450 (smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n).
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|