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!)
 A073627 a(1)=a(2)=1; for n > 2, a(n) is the smallest integer such that a(n) > a(n-1) and a(n)+a(n-1) is prime. 9
 1, 1, 2, 3, 4, 7, 10, 13, 16, 21, 22, 25, 28, 31, 36, 37, 42, 47, 50, 51, 52, 55, 58, 69, 70, 79, 84, 89, 90, 91, 100, 111, 112, 115, 118, 121, 130, 133, 136, 141, 142, 151, 156, 157, 160, 171, 176, 177, 182, 185, 188, 191, 192, 197, 200, 201, 208, 211, 220, 223 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Essentially the same as A062042. [John W. Layman, Oct 11 2013] LINKS T. D. Noe, Table of n, a(n) for n = 1..1000 MATHEMATICA s=1; Join[{1, 1}, Table[k=s+1; While[ !PrimeQ[k+s], k++ ]; s=k, {100}]] (* T. D. Noe, Nov 02 2009 *) PROG (PARI) FirstTerms(n)={my(x=1, y, a=vector(n), j=2); a[1]=1; a[2]=1; while(j++<=n, y=x+1; while(!isprime(x+y), y++); x=y; a[j]=y); return(a)} \\ R. J. Cano, Jan 18 2017 CROSSREFS Cf. A073628. Sequence in context: A105330 A097545 A202016 * A062042 A107817 A008811 Adjacent sequences:  A073624 A073625 A073626 * A073628 A073629 A073630 KEYWORD nonn AUTHOR Amarnath Murthy, Aug 08 2002 EXTENSIONS Edited by Matthew Conroy, Oct 21 2002 Definition corrected by T. D. Noe, Nov 02 2009 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 7 13:08 EST 2021. Contains 349581 sequences. (Running on oeis4.)