A128168 Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^4 = 1 + A122102(k).

1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16, 20, 24, 27, 30, 32, 39, 40, 45, 48, 58, 60, 80, 88, 90, 96, 100, 120, 138, 168, 180, 207, 216, 240, 328, 342, 353, 360, 456, 470, 480, 496, 564, 591, 768, 840, 1040, 1215, 1276, 1355, 1360, 1395, 1440, 1600, 2208, 2576, 2904

Offset: 1

Author

Alexander Adamchuk, Feb 22 2007

Keywords

• nonn

Comments

a(280) > 5*10^13. - Bruce Garner, Jun 05 2021

Links

• Bruce Garner, Table of n, a(n) for n = 1..279 (terms 1..215 from Robert Price)
• OEIS Wiki, Sums of powers of primes divisibility sequences

Crossrefs

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

Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.

Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.

Programs

Mathematica

s = 1; Do[s = s + Prime[n]^4; If[ Mod[s, n] == 0, Print[n]], {n, 17500}]