The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A232558 a(1)=5, q=a(n) is the smallest prime > a(n-1) such that q-2*n = p prime 3
 5, 7, 11, 13, 17, 19, 31, 47, 59, 61, 83, 97, 109, 131, 137, 139, 173, 193, 211, 233, 239, 241, 257, 271, 277, 281, 283, 307, 389, 397, 409, 431, 433, 457, 467, 491, 523, 563, 569, 571, 653, 661, 673, 701, 709, 733, 821, 823, 859, 887, 911, 967, 983, 991 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Conjecture: the sequence is infinite. Remarks: the primes p appears in increasing order but with repetition, all the primes are not present in p,q. LINKS Pierre CAMI, Table of n, a(n) for n = 1..10000 EXAMPLE 5-3=2 a(1)=5 7-3=4 a(2)=7 11-5=6 a(3)=11 13-5=8 a(4)=13 17-7=10 a(5)=17 MATHEMATICA a[1]=5; a[n_]:=a[n]=(For[k=a[n-1]+2, !(k>2n&&PrimeQ[k]&&PrimeQ[k-2n]), k++]; k) CROSSREFS Cf. A020483 Sequence in context: A191056 A314296 A141639 * A290246 A024891 A277907 Adjacent sequences:  A232555 A232556 A232557 * A232559 A232560 A232561 KEYWORD nonn AUTHOR Pierre CAMI, Nov 26 2013 STATUS approved

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 May 27 21:14 EDT 2022. Contains 354110 sequences. (Running on oeis4.)