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 A125828 #46 Dec 03 2024 08:14:51
%S A125828 1,43,824747,3171671,767335408183,921649796621,1367268373487,
%T A125828 8978321374181,35467651791527,177538435814203
%N A125828 Numbers m that divide 2^8 + 3^8 + ... + prime(m)^8.
%C A125828 No other terms up to 10^8. - _Stefan Steinerberger_, Jun 06 2007
%C A125828 No other terms up to pi(10^13). - _Charles R Greathouse IV_, Apr 14 2011
%C A125828 a(10) > 4*10^13. - _Bruce Garner_, Jul 07 2021
%C A125828 a(11) > 5*10^14. - _Paul W. Dyson_, Dec 03 2024
%H A125828 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>.
%F A125828 Equals A000720 o A232822, i.e., a(n)=PrimePi(A232822(n)). - _M. F. Hasler_, Dec 01 2013
%t A125828 s = 0; t = {}; Do[s = s + Prime[n]^8; If[ Mod[s, n] == 0, AppendTo[t, n]], {n, 1000000}]; t
%o A125828 (PARI) S=n=0; forprime(p=1,,(S+=p^8)%n++||print1(n",")) \\ _M. F. Hasler_, Dec 01 2013
%K A125828 nonn,hard,more
%O A125828 1,2
%A A125828 _Alexander Adamchuk_, Feb 03 2007
%E A125828 a(4) from _Stefan Steinerberger_, Jun 06 2007
%E A125828 a(5)-a(6) from _Paul W. Dyson_, Jan 01 2021
%E A125828 a(7) from _Bruce Garner_, Mar 02 2021
%E A125828 a(8) from _Bruce Garner_, Mar 30 2021
%E A125828 a(9) from _Bruce Garner_, Jul 07 2021
%E A125828 a(10) from _Paul W. Dyson_, Jul 07 2023