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 A131263 #42 Dec 16 2024 21:58:35
%S A131263 1,281525,1011881,13721649,309777093,417800903,12252701193,
%T A131263 27377813605,37762351523,245773819141,51230573255953,82578361848569,
%U A131263 277900491430385
%N A131263 Numbers k such that k divides 2^9 + 3^9 + 5^9 + ... + prime(k)^9.
%C A131263 a(12) > 5.5*10^13. - _Paul W. Dyson_, Mar 27 2021
%C A131263 a(13) > 10^14. - _Bruce Garner_, Jan 10 2022
%C A131263 a(14) > 3*10^14. - _Paul W. Dyson_, Aug 11 2022
%C A131263 a(14) > 5*10^14. - _Paul W. Dyson_, Dec 16 2024
%H A131263 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>.
%t A131263 s = 0; Do[s = s + Prime[n]^9; If[ Mod[s, n] == 0, Print[n]], {n, 1100000}]
%o A131263 (PARI) s=0; n=0; forprime(p=2, 1e9, s+=p^9; if(s%n++==0, print1(n", "))) \\ _Charles R Greathouse IV_, Apr 14 2011
%Y A131263 Cf. A085450 (smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n).
%Y A131263 Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
%Y A131263 Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%K A131263 nonn,more
%O A131263 1,2
%A A131263 _Alexander Adamchuk_, Jun 25 2007, Jun 27 2007
%E A131263 a(4) from _Robert G. Wilson v_, Jun 27 2007
%E A131263 a(5)-a(10) from _Charles R Greathouse IV_, Apr 14 2011
%E A131263 a(11) from _Paul W. Dyson_, Mar 27 2021
%E A131263 a(12) from _Bruce Garner_, Jan 10 2022
%E A131263 a(13) from _Paul W. Dyson_, Aug 11 2022