

A125907


Numbers k such that k divides 2^4 + 3^4 + 5^4 + ... + prime(k)^4.


4




OFFSET

1,2


COMMENTS

a(4) is less than 10^13 contradicting the previous comment. It was found using the primesieve library by Kim Walisch and gmplib.  Bruce Garner, Feb 26 2021


LINKS



MATHEMATICA

a(1) = 1; s = 2^4; Do[s = s + Prime[2n]^4+Prime[2n+1]^4; If[ Mod[s, 2n+1] == 0, Print[2n+1]], {n, 1, 20000000}]


PROG



CROSSREFS

Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.


KEYWORD

bref,hard,more,nonn


AUTHOR



EXTENSIONS



STATUS

approved



