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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A213903 Least number x such that there are n numbers of the form 6k-1 or 6k+1 between prime(x) and prime(x+1). 0
 1, 9, 24, 46, 30, 99, 154, 263, 367, 590, 217, 1183, 2191, 1879, 1831, 3077, 2225, 3793, 4612, 4522, 3644, 14862, 12542, 3385, 19026, 17006, 23283, 38590, 14357, 34215, 73321, 30802, 33608, 110224, 85633, 165326, 31545, 40933, 103520, 141718, 224659, 126172 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS First occurrence of n in A213902. LINKS EXAMPLE Smallest n such that A213902(n)=2 is n=24, so a(2)=24. MATHEMATICA nn = 10^6; t = Join[{3}, Union[6 Range[nn] - 1, 6 Range[nn] + 1]]; cnt = 0; t2 = Reap[Do[If[PrimeQ[t[[i]]], Sow[cnt]; cnt = 0, cnt++], {i, Length[t]}]][[2, 1]]; t3 = {}; n = 0; While[pos = Position[t2, n, 1, 1]; pos != {}, AppendTo[t3, pos[[1, 1]]]; n++]; t3 (* T. D. Noe, Jun 26 2012 *) CROSSREFS Cf. A213902. Sequence in context: A262044 A097658 A067725 * A001106 A023551 A022787 Adjacent sequences:  A213900 A213901 A213902 * A213904 A213905 A213906 KEYWORD nonn AUTHOR Alex Ratushnyak, Jun 24 2012 STATUS approved

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 January 22 04:27 EST 2020. Contains 331133 sequences. (Running on oeis4.)