OFFSET
1,3
COMMENTS
If n is a k-digit number, then we demand that p = (n+2) * 10^k + n - (n+1) is a prime number, obviously of the form p = (n+2) * 10^k - 1, so the decimal representation of p is n+1 followed by k times the digit 9.
The sequence is infinite, proof with Dirichlet's prime number (in arithmetic progressions) theorem.
Note that numbers of the form (n+2)//n + (n+1) are multiples of 3 and do not generate primes.
EXAMPLE
2//0 - 1 = 20 - 1 = 19 = prime(8), 0 is first term;
3//1 - 2 = 31 - 2 = 29 = prime(10), 1 is 2nd term;
6//4 - 5 = 64 - 5 = 59 = prime(17), 4 is 3rd term.
MATHEMATICA
n2ncQ[n_]:=PrimeQ[FromDigits[Join[IntegerDigits[n+2], IntegerDigits[ n]]]- n-1]; Select[Range[0, 300], n2ncQ] (* Harvey P. Dale, Feb 24 2011 *)
CROSSREFS
KEYWORD
base,easy,nonn
AUTHOR
Ulrich Krug (leuchtfeuer37(AT)gmx.de), May 11 2010
STATUS
approved