|
Search: id:A020483
|
|
|
| A020483 |
|
Least p with p, q both prime, such that p+2n = q. |
|
+0
15
|
|
| 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 7, 5, 3, 3, 7, 5, 3, 5, 3, 3, 5, 3, 7, 5, 3, 7, 5, 3, 3, 7, 5, 3, 5, 3, 3, 7, 5, 3, 5, 3, 7, 5, 3, 13, 7, 5, 3, 5, 3, 3, 5, 3, 3, 5, 3, 19, 13, 11, 13, 7, 5, 3, 5, 3, 7, 5, 3, 3, 11, 11, 7, 5, 3, 3, 7, 5, 3, 7, 5, 3, 5, 3, 7, 5, 3, 7, 5, 3, 3, 11, 11, 7, 5, 3, 3, 5, 3, 3, 13, 11, 31, 7
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
It is conjectured that a(n) always exists. a(n) has been computed for n < 5*10^11, with largest value a(248281210271)=3307. - Jens Kruse Andersen (jens.k.a(AT)get2net.dk), Nov 28 2004
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..10000
J. K. Andersen, Prime gaps (not necessarily consecutive).
|
|
FORMULA
|
If a(n) exists, a(n) < 2n, which of course is a great overestimate. - T. D. Noe (noe(AT)sspectra.com), Jul 16 2002
a(n)=A087711(n)-n (Zak Seidov, Nov 28 2007)
|
|
MATHEMATICA
|
Table[j=1; found=False; While[ !found, j++; found=PrimeQ[Prime[j]+2i]]; Prime[j], {i, 200}]
f[n_] := Block[{k = 1, p, q = 2 n}, While[p = Prime@k; !PrimeQ[p + q], k++ ]; p]; Array[f, 102] (* Robert G. Wilson v, (rgwv@rgwv.com), Mar 26 2008 *)
|
|
CROSSREFS
|
Cf. A087711, A101042, A101043, A101044, A101045, A101046.
Sequence in context: A066670 A013606 A054906 this_sequence A138479 A136019 A063714
Adjacent sequences: A020480 A020481 A020482 this_sequence A020484 A020485 A020486
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
David W. Wilson (davidwwilson(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|
