|
|
A232966
|
|
Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^14.
|
|
1
|
|
|
1, 2, 3, 4, 6, 8, 9, 12, 13, 24, 26, 28, 45, 48, 88, 168, 360, 474, 540, 550, 864, 1104, 1230, 1408, 1488, 1816, 2367, 2677, 3507, 5592, 5916, 6612, 11238, 12925, 14124, 23523, 24087, 27356, 41528, 43465, 56951, 74688, 79244, 86682, 181730, 186136, 193704
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
a(7)=9 because 1 plus the sum of the first 9 primes^14 is 12564538647431705217 which is divisible by 9.
|
|
MATHEMATICA
|
p = 2; k = 0; s = 1; lst = {}; While[k < 40000000000, s = s + p^14; If[Mod[s, ++k] == 0, AppendTo[lst, k]; Print[{k, p}]]; p = NextPrime@ p] (* derived from A128169 *)
|
|
CROSSREFS
|
Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|