|
%I #32 Jul 09 2023 21:58:23
%S 1,269,41837,36626159,154578947,2155054465,19410890423,30691222355,
%T 247555091527,2201220228533,227735225320519
%N Numbers k such that k divides 2^10 + 3^10 + 5^10 + ... + prime(k)^10.
%C a(11) > 2.6*10^12. - _Bruce Garner_, Mar 06 2021
%H OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>.
%t s = 0; Do[s = s + Prime[n]^10; If[ Mod[s, n] == 0, Print[n]], {n, 1000000}]
%o (PARI) s=0;n=0;forprime(p=2, 1e9, s+=p^10; if(s%n++==0, print1(n", "))) \\ _Charles R Greathouse IV_, Apr 14 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.
%K nonn,more
%O 1,2
%A _Alexander Adamchuk_, Jun 25 2007
%E a(4) & a(5) from _Robert G. Wilson v_, Jun 28 2007
%E a(6)-a(9) from _Charles R Greathouse IV_, Apr 14 2011
%E a(10) from _Bruce Garner_, Mar 06 2021
%E a(11) from _Paul W. Dyson_, Jul 09 2023
|
