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 A131274 #28 Nov 24 2024 01:52:36
%S A131274 1,295,455,4361,10817,132680789,334931875,957643538339,82185210732157
%N A131274 Numbers m such that m divides Sum_{k=1..m} prime(k)^14.
%C A131274 a(8) > 4.1*10^10. - _Robert Price_, Dec 02 2013
%C A131274 a(9) > 10^12. - _Paul W. Dyson_, Jan 03 2021
%C A131274 a(10) > 2*10^15. - _Paul W. Dyson_, Nov 23 2024
%H A131274 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>.
%t A131274 s = 0; Do[s = s + Prime[n]^14; If[ Mod[s, n] == 0, Print[n]], {n, 660000000}] (* _Robert G. Wilson v_, Jul 01 2007 *)
%t A131274 With[{nn=11000},Select[Thread[{Accumulate[Prime[Range[nn]]^14],Range[ nn]}],Divisible[ #[[1]],#[[2]]]&]][[All,2]] (* The program generates the first 5 terms of the sequence. To generate more, increase the value of nn. *) (* _Harvey P. Dale_, Jun 25 2021 *)
%Y A131274 Cf. A085450 (smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n).
%Y A131274 Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
%Y A131274 Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%K A131274 more,nonn,less
%O A131274 1,2
%A A131274 _Alexander Adamchuk_, Jun 25 2007
%E A131274 a(6) from _Robert G. Wilson v_, Jul 01 2007
%E A131274 a(7) from _Robert Price_, Dec 02 2013
%E A131274 a(8) from _Paul W. Dyson_, Jan 03 2021
%E A131274 a(9) from _Bruce Garner_, Mar 28 2022