The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A008995 Increasing length runs of consecutive composite numbers (endpoints). 6

%I

%S 4,10,28,96,126,540,906,1150,1360,9586,15726,19660,31468,156006,

%T 360748,370372,492226,1349650,1357332,2010880,4652506,17051886,

%U 20831532,47326912,122164968,189695892,191913030

%N Increasing length runs of consecutive composite numbers (endpoints).

%D Netnews group rec.puzzles, circa Mar 01 1996 (I would like to get the exact reference).

%H 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 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 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PrimeGaps.html">Prime Gaps</a>.

%F a(n) = A000101(n+1)-1.

%t 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 Cf. A000101, A008950, A008996.

%K nonn,changed

%O 1,1

%A Mark Cramer (m.cramer(AT)qut.edu.au). Computed by Dennis Yelle (dennis(AT)netcom.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 8 08:27 EDT 2020. Contains 336293 sequences. (Running on oeis4.)