|
|
A233349
|
|
Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^13.
|
|
1
|
|
|
1, 2, 4, 6, 10, 12, 52, 74, 136, 242, 305, 670, 1431, 1706, 1713, 3956, 18331, 22238, 25162, 107332, 162778, 169479, 431228, 459704, 1808681, 1813273, 5954563, 10351930, 27931668, 32490143, 201039164, 311357190, 733854046, 1677164490, 3722808264, 9000784596
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
a(5) = 10 because 1 plus the sum of the first 10 primes^13 is 10816960132320284800 which is divisible by 10.
|
|
MATHEMATICA
|
p = 2; k = 0; s = 1; lst = {}; While[k < 40000000000, s = s + p^13; 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
|
|
|
|