|
%I #28 Oct 03 2023 20:03:51
%S 1,37,265,17207,9382589,970248431,2427811793,156281194823,
%T 2955922292131,372012276565795
%N Numbers m such that m divides the sum of the 18th powers of the first m primes.
%C a(10) > 3.0*10^12. - _Bruce Garner_, Mar 17 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]^18; If[ Mod[s, n] == 0, Print[n]], {n, 10^6}]
%t With[{nn = 18000}, Transpose[With[{c = Thread[{Range[nn], Accumulate[Prime[ Range[nn]]^18]}]}, Select[c, Divisible[Last[#], First[#]] &]]][[1]]] (* _Harvey P. Dale_, Dec 19 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 more,nonn
%O 1,2
%A _Alexander Adamchuk_, Jun 25 2007
%E a(5)-a(7) from _Robert Price_, Dec 13 2013
%E a(8) from _Paul W. Dyson_, Jan 08 2021
%E a(9) from _Bruce Garner_, Mar 17 2021
%E a(10) from _Paul W. Dyson_, Oct 03 2023
|
