The OEIS is supported by the many generous donors to the OEIS 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A144103 Let N(p,i) denote the result of applying "nextprime" i times to p; a(n) = smallest prime p such that N(p,2) - p = 2*n, or -1 if no such prime exists. 4
 -1, 3, 5, 23, 19, 47, 83, 211, 109, 317, 619, 199, 1373, 1123, 1627, 4751, 2557, 3413, 4289, 1321, 2161, 2477, 7963, 5591, 9551, 17239, 15823, 14087, 19603, 34963, 36389, 33223, 24251, 35603, 43321, 19609, 134507, 31393, 136999, 31397, 38461, 107357 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS p and p+2n are primes and there is one prime in the range p+1 to p+2n-1. a(n) is the prime for which 2n+2 first occurs in A031131. LINKS Martin Raab, Table of n, a(n) for n = 1..408 (Terms 1..342 from Robert G. Wilson) MATHEMATICA nn=51; t=Table[0, {nn}]; t[[1]]=-1; cnt=1; n=1; While[cnt

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

Last modified December 1 01:13 EST 2022. Contains 358453 sequences. (Running on oeis4.)