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 A371001 #24 Mar 18 2024 11:44:26
%S A371001 4,8,21,24,26,119,134,185,290,314,626,1784,6041,7556,8876,43181,52454,
%T A371001 159731,218084,576239,1478531,2934539,3085781,3569114,3802301,4692866,
%U A371001 24307841,25051934,54168539,285820856,551855834,742623164,747988526,1165052066,3322447301
%N A371001 Least number k such that the number m of consecutive composite sums k + j^2, j = 0, ..., m is a new maximum.
%H A371001 Hugo Pfoertner, <a href="/A371001/b371001.txt">Table of n, a(n) for n = 1..56</a> (terms a(1)-a(50) from Martin Ehrenstein)
%e A371001 See A371002.
%o A371001 (PARI) a371001_2(upto) = {my(n=0); forcomposite (k=4, upto, for (j=1, oo, if (isprime(k+j*j), if (j>n, print1([k,j-1],", "); n=j); break)))};
%o A371001 \\ change [k,j-1] in print1 to k or j-1 to mute the results for the other sequence
%o A371001 a371001_2(5000000)
%Y A371001 A371002 gives the corresponding counts m.
%Y A371001 Cf. A000290, A002808.
%K A371001 nonn
%O A371001 1,1
%A A371001 _Hugo Pfoertner_, Mar 07 2024