login
A128170
Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^6.
1
1, 2, 3, 4, 6, 7, 8, 9, 12, 14, 18, 21, 24, 27, 28, 29, 34, 36, 42, 45, 48, 54, 56, 63, 72, 84, 112, 126, 159, 168, 174, 198, 204, 216, 252, 310, 312, 336, 360, 400, 408, 441, 504, 505, 540, 588, 591, 657, 672, 716, 864, 900, 1080, 1152, 1316, 1350, 1380, 1680, 1722
OFFSET
1,2
COMMENTS
a(301) > 1.4*10^13. - Bruce Garner, Apr 07 2021
LINKS
Bruce Garner, Table of n, a(n) for n = 1..300 (first 229 terms from Robert Price)
MATHEMATICA
s = 1; Do[s = s + Prime[n]^6; If[ Mod[s, n] == 0, Print[n]], {n, 10000}]
Module[{nn=1750, pr}, pr=Accumulate[Prime[Range[nn]]^6]; Select[Thread[ {Range[ nn], pr}], Divisible[#[[2]]+1, #[[1]]]&]][[All, 1]] (* Harvey P. Dale, Feb 10 2019 *)
PROG
(PARI) n=0; s=1; forprime(p=2, , s+=p^6; if(s%n++==0, print1(n", "))) \\ Charles R Greathouse IV, Dec 03 2013
CROSSREFS
Cf. A085450 (smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n).
Sequence in context: A134003 A267301 A233576 * A018490 A351038 A113498
KEYWORD
nonn
AUTHOR
Alexander Adamchuk, Feb 22 2007
STATUS
approved