login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
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.
MATHEMATICA
Transpose[Select[Partition[Prime[Range[500]], 2, 1], Abs[Mod[First[#], 10]-Mod[Last[#], 10]]==8&]][[1]] (* Harvey P. Dale, Nov 06 2012 *)
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 A326897 A139507
KEYWORD
easy,nonn,base,less
AUTHOR
Cino Hilliard, May 19 2007
STATUS
approved