cp's OEIS Frontend

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.

A131273 Numbers k that divide Sum_{j=1..k} prime(j)^13.

This page as a plain text file.
%I A131273 #44 Dec 06 2024 20:18:55
%S A131273 1,23,299,313,171287,435705,487475,3774601,219347813,9613155161,
%T A131273 5150163868035,37365789554345,228914067371295
%N A131273 Numbers k that divide Sum_{j=1..k} prime(j)^13.
%C A131273 a(13) > 4*10^13. - _Bruce Garner_, Aug 30 2021
%C A131273 a(14) > 5*10^14. - _Paul W. Dyson_, Dec 06 2024
%H A131273 OEIS Wiki, <a href="https://oeis.org/wiki/Sums_of_primes_divisibility_sequences">Sums of powers of primes divisibility sequences</a>.
%t A131273 s = 0; Do[s = s + Prime[n]^13; If[ Mod[s, n] == 0, Print[n]], {n, 200000}]
%o A131273 (PARI) S=n=0;forprime(p=1,,(S+=p^13)%n++||print1(n",")) \\ _M. F. Hasler_, Dec 01 2013
%Y A131273 Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
%Y A131273 Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
%Y A131273 Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.
%K A131273 more,nonn,less
%O A131273 1,2
%A A131273 _Alexander Adamchuk_, Jun 25 2007
%E A131273 a(6)-a(8) from _Robert G. Wilson v_, Jun 30 2007
%E A131273 a(9)-a(10) from _Robert Price_, Nov 28 2013
%E A131273 a(11) from _Bruce Garner_, Mar 23 2021
%E A131273 a(12) from _Bruce Garner_, Aug 30 2021
%E A131273 a(13) from _Paul W. Dyson_, Apr 20 2023