The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A125907 Numbers k such that k divides 2^4 + 3^4 + 5^4 + ... + prime(k)^4. 4
 1, 2951, 38266951, 3053263643573 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS No more terms to 10^13. - Charles R Greathouse IV, Mar 21 2011 a(4) is less than 10^13 contradicting the previous comment. It was found using the primesieve library by Kim Walisch and gmplib. - Bruce Garner, Feb 26 2021 LINKS OEIS Wiki, Sums of powers of primes divisibility sequences. MATHEMATICA a(1) = 1; s = 2^4; Do[s = s + Prime[2n]^4+Prime[2n+1]^4; If[ Mod[s, 2n+1] == 0, Print[2n+1]], {n, 1, 20000000}] PROG (PARI) s=0; n=0; forprime(p=2, 4e9, s+=p^4; if(s%n++==0, print1(n", "))) \\ Charles R Greathouse IV, Mar 21 2011 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. Cf. A122102, A232869, A128168, A233893. Sequence in context: A096628 A051024 A177087 * A025514 A204393 A178273 Adjacent sequences:  A125904 A125905 A125906 * A125908 A125909 A125910 KEYWORD bref,hard,more,nonn AUTHOR Alexander Adamchuk, Feb 04 2007 EXTENSIONS a(4) from Bruce Garner, Feb 26 2021 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 October 20 16:07 EDT 2021. Contains 348111 sequences. (Running on oeis4.)