A371001 - OEIS

%I #24 Mar 18 2024 11:44:26

%S 4,8,21,24,26,119,134,185,290,314,626,1784,6041,7556,8876,43181,52454,

%T 159731,218084,576239,1478531,2934539,3085781,3569114,3802301,4692866,

%U 24307841,25051934,54168539,285820856,551855834,742623164,747988526,1165052066,3322447301

%N Least number k such that the number m of consecutive composite sums k + j^2, j = 0, ..., m is a new maximum.

%H 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 See A371002.

%o (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 \\ change [k,j-1] in print1 to k or j-1 to mute the results for the other sequence

%o a371001_2(5000000)

%Y A371002 gives the corresponding counts m.

%Y Cf. A000290, A002808.

%K nonn

%O 1,1

%A _Hugo Pfoertner_, Mar 07 2024