This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A131273 Numbers n such that n divides Sum[ Prime[k]^13, {k,1,n} ]. 1
 1, 23, 299, 313, 171287, 435705, 487475, 3774601, 219347813, 9613155161 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(11) > 4*10^10. - Robert Price, Nov 28 2013 LINKS OEIS Wiki, Sums of powers of primes divisibility sequences. 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. Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248. Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601. Sequence in context: A199031 A125435 A086943 * A023021 A022651 A267266 Adjacent sequences:  A131270 A131271 A131272 * A131274 A131275 A131276 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 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.

Last modified August 20 01:14 EDT 2019. Contains 326136 sequences. (Running on oeis4.)