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 A131279 #44 Jan 01 2025 03:27:03
%S A131279 1,25,453,677,839,1015,3735,4175,4413,10369,14239,43311,452567,
%T A131279 1274185,14102849,37801813,71271705,93524231,386557609,2151748733,
%U A131279 261349938459,761474469415,1284262332971,5115376212971,17863411895047,122189141425495
%N A131279 Numbers k such that k divides Sum_{j=1..k} prime(j)^19.
%C A131279 a(26) > 2*10^13. - _Bruce Garner_, Jun 30 2021
%C A131279 a(27) > 5*10^14. - _Paul W. Dyson_, Dec 31 2024
%H A131279 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>.
%t A131279 s = 0; Do[s = s + Prime[n]^19; If[ Mod[s, n] == 0, Print[n]], {n, 50000}]
%Y A131279 Cf. A085450 (smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n).
%Y A131279 Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
%Y A131279 Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%K A131279 nonn
%O A131279 1,2
%A A131279 _Alexander Adamchuk_, Jun 25 2007
%E A131279 More terms from _Ryan Propper_, Oct 09 2007
%E A131279 a(19)-a(20) from _Robert Price_, Dec 15 2013
%E A131279 a(21) from _Karl-Heinz Hofmann_, Feb 24 2021
%E A131279 a(22) from _Bruce Garner_, Mar 01 2021
%E A131279 a(23) from _Bruce Garner_, Mar 08 2021
%E A131279 a(24) from _Bruce Garner_, Apr 14 2021
%E A131279 a(25) from _Bruce Garner_, Jun 30 2021
%E A131279 a(26) from _Paul W. Dyson_, Jun 27 2023