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.

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

Original entry on oeis.org

4, 8, 21, 24, 26, 119, 134, 185, 290, 314, 626, 1784, 6041, 7556, 8876, 43181, 52454, 159731, 218084, 576239, 1478531, 2934539, 3085781, 3569114, 3802301, 4692866, 24307841, 25051934, 54168539, 285820856, 551855834, 742623164, 747988526, 1165052066, 3322447301
Offset: 1

Views

Author

Hugo Pfoertner, Mar 07 2024

Keywords

Examples

			See A371002.
		

Crossrefs

A371002 gives the corresponding counts m.

Programs

  • 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)))};
    \\ change [k,j-1] in print1 to k or j-1 to mute the results for the other sequence
    a371001_2(5000000)