A128171 Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^7.

1, 2, 4, 5, 6, 10, 12, 46, 1830, 2086, 6000, 7681, 8242, 15204, 43698, 52054, 154490, 211052, 392767, 4309540, 6452151, 8773101, 15166410, 26552623, 176656106, 180281161, 568507964, 608235488, 620790480, 1053296976, 1627363527, 3740702866, 20254119186

Offset: 1

Author

Alexander Adamchuk, Feb 22 2007, Feb 23 2007

Keywords

• hard
• nonn

Comments

a(43) > 1.4*10^13. - Bruce Garner, Apr 07 2021

Links

• Bruce Garner, Table of n, a(n) for n = 1..42 (first 35 terms 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]^7; If[ Mod[s, n] == 0, Print[n]], {n, 1000000}]

Extensions

More terms from Sean A. Irvine, Jan 18 2011

a(27)-a(35) from Robert Price, Dec 03 2013