This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A131278 #32 Dec 16 2024 21:59:08
%S A131278 1,37,265,17207,9382589,970248431,2427811793,156281194823,
%T A131278 2955922292131,372012276565795
%N A131278 Numbers m such that m divides the sum of the 18th powers of the first m primes.
%C A131278 a(10) > 3.0*10^12. - _Bruce Garner_, Mar 17 2021
%C A131278 a(11) > 5*10^14. - _Paul W. Dyson_, Dec 16 2024
%H A131278 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>.
%t A131278 s = 0; Do[s = s + Prime[n]^18; If[ Mod[s, n] == 0, Print[n]], {n, 10^6}]
%t A131278 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 A131278 Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
%Y A131278 Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
%Y A131278 Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%K A131278 more,nonn
%O A131278 1,2
%A A131278 _Alexander Adamchuk_, Jun 25 2007
%E A131278 a(5)-a(7) from _Robert Price_, Dec 13 2013
%E A131278 a(8) from _Paul W. Dyson_, Jan 08 2021
%E A131278 a(9) from _Bruce Garner_, Mar 17 2021
%E A131278 a(10) from _Paul W. Dyson_, Oct 03 2023