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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A284708 Smallest initial prime p for n primes in increasing arithmetic progression with a common difference less than p. 0
 2, 2, 3, 11, 37, 107, 409, 409, 409, 25471, 53173, 65003, 766439, 11797483 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Conjecture: a(n) > A034386(n) for every n >= 4. LINKS EXAMPLE Smallest initial prime p, primes in arithmetic progression: a(1) = 2: (2); a(2) = 2: (2, 3); a(3) = 3: (3, 5, 7); a(4) = 11: (11, 17, 23, 29); a(5) = 37: (37, 67, 97, 127, 157); a(6) = 107: (107, 137, 167, 197, 227, 257); CROSSREFS Sequence in context: A157301 A143931 A143933 * A265783 A246670 A075095 Adjacent sequences:  A284705 A284706 A284707 * A284709 A284710 A284711 KEYWORD nonn,more AUTHOR Arkadiusz Wesolowski, Jan 09 2018 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 December 5 20:26 EST 2021. Contains 349558 sequences. (Running on oeis4.)