login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A131273
Numbers k that divide Sum_{j=1..k} prime(j)^13.
1
1, 23, 299, 313, 171287, 435705, 487475, 3774601, 219347813, 9613155161, 5150163868035, 37365789554345, 228914067371295
OFFSET
1,2
COMMENTS
a(13) > 4*10^13. - Bruce Garner, Aug 30 2021
a(14) > 5*10^14. - Paul W. Dyson, Dec 06 2024
MATHEMATICA
s = 0; Do[s = s + Prime[n]^13; If[ Mod[s, n] == 0, Print[n]], {n, 200000}]
PROG
(PARI) S=n=0; forprime(p=1, , (S+=p^13)%n++||print1(n", ")) \\ M. F. Hasler, Dec 01 2013
CROSSREFS
Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
Sequence in context: A199031 A125435 A086943 * A023021 A022651 A267266
KEYWORD
more,nonn,less
AUTHOR
Alexander Adamchuk, Jun 25 2007
EXTENSIONS
a(6)-a(8) from Robert G. Wilson v, Jun 30 2007
a(9)-a(10) from Robert Price, Nov 28 2013
a(11) from Bruce Garner, Mar 23 2021
a(12) from Bruce Garner, Aug 30 2021
a(13) from Paul W. Dyson, Apr 20 2023
STATUS
approved