OFFSET
1,1
COMMENTS
There are 18 digit pairs which can produce such primes. (1, 0), (1, 3), (1, 4), (1, 6), (1, 7), (1, 9), (2, 3), (2, 9), (3, 4), (3, 5), (3, 7), (3, 8), (4, 7), (4, 9), (5, 9), (6, 7), (7, 9), (8, 9). - corrected by Robert Israel, Jul 10 2018
The number of digits is even and not divisible by 3. - Robert Israel, Jul 09 2018
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
MAPLE
sort(select(isprime, [seq(seq((10^(2*d)-1)/9+2*add(10^i, i=s), s=combinat:-choose([$0..(2*d-1)], d)), d=[1, 2, 4, 5, 7, 8, 10])])); # Robert Israel, Jul 09 2018
MATHEMATICA
Union[FromDigits/@Select[Flatten[Table[Tuples[{1, 3}, k], {k, 10}], 1], PrimeQ[FromDigits[#]] && Count[#, 1]==Count[#, 3] &]] (* Jayanta Basu, May 19 2013 *)
PROG
(PARI) \\ Needs B() from A087510.
concat(vector(6, k, B(k, 1, 3, isprime))) \\ Andrew Howroyd, Sep 21 2024
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Paul D. Hanna and Amarnath Murthy, Sep 11 2003
STATUS
approved