|
|
A233461
|
|
Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^16.
|
|
1
|
|
|
1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16, 17, 20, 24, 27, 30, 32, 34, 39, 40, 45, 48, 51, 55, 57, 60, 64, 68, 80, 85, 90, 96, 100, 102, 120, 128, 136, 160, 168, 170, 180, 186, 192, 204, 205, 216, 230, 238, 240, 255, 272, 285, 320, 340, 360, 384, 408, 480, 510
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
a(9)=10 because 1 plus the sum of the first 10 primes^16 is 256716898101196243797130 which is divisible by 10.
|
|
MATHEMATICA
|
p = 2; k = 0; s = 1; lst = {}; While[k < 40000000000, s = s + p^16; 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
|
|
|
|