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!)
 A156314 Smallest prime p such that p mod prime(k+1) = prime(k) for exactly n distinct k. 1
 2, 5, 23, 47, 283, 557, 5147, 2273, 12899, 103703, 146417, 3369869, 5037233, 71067323, 6484133 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS A156311(A049084(a(n)))=n and A156311(m) 10^8. [From Donovan Johnson, Jul 02 2010] LINKS EXAMPLE a(9) = 103703 = A000040(9910), A156311(9910) = 9: 1: 2 + 3*34567 = prime(1) + prime(2)*34567 = 103703, 2: 3 + 5*20740 = prime(2) + prime(3)*20740 = 103703, 3: 5 + 7*14814 = prime(3) + prime(4)*14814 = 103703, 4: 19 + 23*4508 = prime(8) + prime(9)*4508 = 103703, 5: 131 + 137*756 = prime(32) + prime(33)*756 = 103703, 6: 163 + 167*620 = prime(38) + prime(39)*620 = 103703, 7: 181 + 191*542 = prime(42) + prime(43)*542 = 103703, 8: 751 + 757*136 = prime(133) + prime(134)*136 = 103703, 9: 20731 + 20743*4 = prime(2334) + prime(2335)*4 = 103703. CROSSREFS Sequence in context: A126975 A175444 A233443 * A308055 A173396 A023186 Adjacent sequences:  A156311 A156312 A156313 * A156315 A156316 A156317 KEYWORD more,nonn AUTHOR Reinhard Zumkeller, Feb 07 2009 EXTENSIONS a(10)-a(14) from Donovan Johnson, Jul 02 2010 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 August 9 20:09 EDT 2020. Contains 336326 sequences. (Running on oeis4.)