|
Search: id:A115564
|
|
|
| A115564 |
|
Least number d such that 10^n -/+ d form a prime pair. |
|
+0
4
|
|
| 3, 3, 9, 69, 129, 39, 261, 213, 459, 33, 57, 39, 267, 657, 357, 1377, 3, 387, 1899, 393, 213, 651, 327, 3, 2733, 3423, 1533, 429, 603, 1131, 1137, 1113, 1131, 249, 603, 2979, 159, 429, 921, 1269, 2757, 777, 789, 2277, 11799, 9, 5343, 1821, 6981, 23049, 1623
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(n)== 0 (mod 3). - Robert G. Wilson v (rgwv(at)rgwv.com), Mar 13 2006
|
|
EXAMPLE
|
a(1)=3 because 10-3=7 and 10+3=13 both of which are primes.
a(3)=9 because 1000-9=991 and 1000+9=1009 both of which are primes.
|
|
MATHEMATICA
|
f[n_] := Block[{k = 1}, While[ ! PrimeQ[10^n - 3k] || ! PrimeQ[10^n + 3k], k++ ]; 3k]; Array[f, 50]
|
|
PROGRAM
|
(PARI) { for (n = 1, 80, tenp = 10^n ; p = nextprime(tenp) ; while ( p-tenp < tenp, diff=p-tenp ; if ( isprime(tenp-diff), print1(diff", ") ; break ; ) ; p=nextprime(p+1) ; ) ; ) } - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 15 2006
|
|
CROSSREFS
|
Cf. A113213, A117738.
Sequence in context: A032086 A100239 A038080 this_sequence A122961 A100731 A072004
Adjacent sequences: A115561 A115562 A115563 this_sequence A115565 A115566 A115567
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Lekraj Beedassy (blekraj(AT)yahoo.com), Mar 11 2006
|
|
EXTENSIONS
|
More terms from Craig Baribault (csb166(AT)psu.edu) and Robert G. Wilson v (rgwv(at)rgwv.com), Mar 13 2006
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 15 2006
|
|
|
Search completed in 0.002 seconds
|
