|
%I #30 Feb 27 2021 11:23:47
%S 1,2951,38266951,3053263643573
%N Numbers k such that k divides 2^4 + 3^4 + 5^4 + ... + prime(k)^4.
%C No more terms to 10^13. - _Charles R Greathouse IV_, Mar 21 2011
%C 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
%H OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>.
%t 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}]
%o (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
%Y Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
%Y Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
%Y Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%Y Cf. A122102, A232869, A128168, A233893.
%K bref,hard,more,nonn
%O 1,2
%A _Alexander Adamchuk_, Feb 04 2007
%E a(4) from _Bruce Garner_, Feb 26 2021
|
