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 A370999 #40 Apr 09 2025 07:20:09 %S A370999 4,8,9,15,24,90,105,114,225,264,300,945,5349,7035,11739,17280,35475, %T A370999 46914,190365,351645,603054,1209900,3146220,3279864,6407664,26447649, %U A370999 115192665,408291345,1080430119,1298351109,6459163344,7731193299,8096124894,8884256514,18927105834 %N A370999 Least composite number k such that the number m of consecutive composite sums k + j*(j+1)/2, j = 1, ..., m is a new maximum. %C A370999 a(60) > 10^15. %H A370999 Karl-Heinz Hofmann and Hugo Pfoertner, <a href="/A370999/b370999.txt">Table of n, a(n) for n = 1..59</a> %H A370999 IBM Research, <a href="https://research.ibm.com/haifa/ponderthis/challenges/March2024.html">Composite Sequences</a>, Ponder This Challenge March 2024. %Y A370999 A371000 gives the corresponding counts m. %Y A370999 Cf. A000217, A371001, A371002. %K A370999 nonn %O A370999 1,1 %A A370999 _Karl-Heinz Hofmann_ and _Hugo Pfoertner_, Mar 09 2024 %E A370999 a(43) in b-file corrected by _Kebbaj Mohamed Reda_, May 29 2024