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.
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
Offset: 1
Keywords
Links
- T. D. Noe, Table of n, a(n) for n = 1..1000
Crossrefs
Cf. A073628.
Programs
-
Mathematica
s=1; Join[{1,1}, Table[k=s+1; While[ !PrimeQ[k+s], k++ ]; s=k, {100}]] (* T. D. Noe, Nov 02 2009 *) -
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
Extensions
Edited by Matthew Conroy, Oct 21 2002
Definition corrected by T. D. Noe, Nov 02 2009
Comments