OFFSET
1,2
LINKS
MATHEMATICA
s = 0; Do[s = s + Prime[n]^15; If[ Mod[s, n] == 0, Print[n]], {n, 400000}]
With[{nn = 3*10^6}, Select[Thread[{Accumulate[Prime[ Range[nn]]^15], Range[ nn]}], Divisible[#[[1]], #[[2]]] &]][[All, 2]] (* This will generate the first 14 terms of the sequence; to generate more, increase the value of nn, but it may take a long time to run. *) (* Harvey P. Dale, Oct 03 2016 *)
CROSSREFS
Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
KEYWORD
more,nonn,less
AUTHOR
Alexander Adamchuk, Jun 25 2007
EXTENSIONS
a(12)-a(17) from Robert G. Wilson v, Jul 02 2007
a(18)-a(19) from Robert Price, Dec 09 2013
a(20) from Karl-Heinz Hofmann, Feb 17 2021
a(21) from Bruce Garner, Apr 30 2021
a(22) from Bruce Garner, Jan 07 2022
a(23) from Paul W. Dyson, Apr 18 2024
STATUS
approved