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 A125827 #48 Jan 01 2025 03:26:57
%S A125827 1,25,59,2599,6195,421407,11651191,19293221,255136097,1820015683,
%T A125827 2183556659,7993872143,9850779563,2006892138335,2649677145789,
%U A125827 6645858099781,318039538085101,414996765110825
%N A125827 Numbers m that divide 2^11 + 3^11 + 5^11 + ... + prime(m)^11.
%C A125827 a(17) > 8*10^12. - _Bruce Garner_, Mar 29 2021
%C A125827 a(19) > 5*10^14. - _Paul W. Dyson_, Dec 31 2024
%H A125827 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>.
%t A125827 s = 0; Do[s = s + Prime[n]^11; If[ Mod[s, n] == 0, Print[n]], {n, 7000}]
%o A125827 (PARI) s=0; n=0; forprime(p=2, 4e9, s+=p^11; if(s%n++==0, print1(n", "))) \\ _Charles R Greathouse IV_, Mar 20 2011
%Y A125827 Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
%Y A125827 Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
%Y A125827 Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%K A125827 hard,more,nonn
%O A125827 1,2
%A A125827 _Alexander Adamchuk_, Feb 03 2007
%E A125827 3 more terms from _Stefan Steinerberger_, Jun 06 2007
%E A125827 1 more term from _Sean A. Irvine_, Jan 26 2011
%E A125827 a(10)-a(13) from _Charles R Greathouse IV_, Mar 20 2011
%E A125827 a(14) from _Paul W. Dyson_, Jan 08 2021
%E A125827 a(15) from _Bruce Garner_, Mar 08 2021
%E A125827 a(16) from _Bruce Garner_, Mar 29 2021
%E A125827 a(17) from _Paul W. Dyson_, Jan 03 2023
%E A125827 a(18) from _Paul W. Dyson_, Dec 20 2024