|
| |
|
|
A129813
|
|
Lesser of consecutive prime pairs whose last digits differ by 8.
|
|
0
| |
|
|
29, 59, 149, 179, 199, 239, 269, 401, 419, 491, 509, 569, 599, 619, 659, 701, 761, 809, 911, 1019, 1049, 1129, 1229, 1289, 1319, 1381, 1459, 1499, 1571, 1619, 1709, 1789, 1889, 1949, 2069, 2099, 2129, 2161, 2309, 2339, 2399, 2531, 2549, 2579, 2729, 2741
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 2,1
|
|
|
COMMENTS
| Conjecture: The number of terms in this sequence is infinite.
|
|
|
EXAMPLE
| The last digits of the consecutive prime pair 29 and 31 differ by 8 so 29 is in the table.
|
|
|
PROG
| (PARI) \d can be 2, 4, 6, 8 primediffd(n, d) = { forprime(x=3, n, y=abs((nextprime(x+1)%10-x%10)); if(y==d, print1(x", ") ) ) }
|
|
|
CROSSREFS
| Sequence in context: A073651 A042672 A042670 * A060229 A139507 A196940
Adjacent sequences: A129810 A129811 A129812 * A129814 A129815 A129816
|
|
|
KEYWORD
| easy,nonn,base,less
|
|
|
AUTHOR
| Cino Hilliard (hillcino368(AT)hotmail.com), May 19 2007
|
| |
|
|
