login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128170 Numbers n such that n divides 1 + sum_{1 <= k <= n} prime(k)^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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(230) > 4.2*10^10. - Robert Price, Dec 03 2013

LINKS

Robert Price, Table of n, a(n) for n = 1..229

OEIS Wiki, Sums of powers of primes divisibility sequences

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.

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

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

Sequence in context: A134003 A267301 A233576 * A018490 A113498 A036796

Adjacent sequences:  A128167 A128168 A128169 * A128171 A128172 A128173

KEYWORD

nonn

AUTHOR

Alexander Adamchuk, Feb 22 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 13:01 EDT 2019. Contains 328222 sequences. (Running on oeis4.)