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 A008995 #28 Jul 08 2025 01:26:04
%S A008995 4,10,28,96,126,540,906,1150,1360,9586,15726,19660,31468,156006,
%T A008995 360748,370372,492226,1349650,1357332,2010880,4652506,17051886,
%U A008995 20831532,47326912,122164968,189695892,191913030
%N A008995 Increasing length runs of consecutive composite numbers (endpoints).
%D A008995 Netnews group rec.puzzles, circa Mar 01 1996 (I would like to get the exact reference).
%H A008995 MathForum rec.puzzles archive, <a href="http://web.archive.org/web/20150322065359/http://mathforum.org/rec_puzzles_archive/arithmetic.html">Arithmetic Question 8 - consecutive.composites</a>, June 2005.
%H A008995 User "Abigail", <a href="https://groups.google.com/d/msg/rec.puzzles/IPmRCBFQy6M/RH3J7xseUqoJ">1000 consectutive composites</a> (sic), post in newsgroup rec.puzzles, Jun 19 1996.
%H A008995 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PrimeGaps.html">Prime Gaps</a>.
%F A008995 a(n) = A000101(n+1)-1.
%t A008995 maxGap = 1; Reap[ Do[ gap = Prime[n + 1] - (p = Prime[n]); If[gap > maxGap, Print[p + gap - 1]; Sow[p + gap - 1]; maxGap = gap], {n, 2, 10^8}]][[2, 1]] (* _Jean-François Alcover_, Jun 12 2013 *)
%Y A008995 Cf. A000101, A008950, A008996.
%K A008995 nonn
%O A008995 1,1
%A A008995 Mark Cramer (m.cramer(AT)qut.edu.au). Computed by Dennis Yelle (dennis(AT)netcom.com)