%N Palindromic primes p such that if each digit d is replaced by 10-d then the resulting palindrome is also a prime.
%C Digit 0 is not allowed. - _Robert Israel_, Sep 14 2020
%H Robert Israel, <a href="/A088092/b088092.txt">Table of n, a(n) for n = 1..10000</a>
%e 181 is a member as replacing 1 by 10-1 = 9 and 8 by 10-8 =2 gives 929 which is also a prime.
%p R:= NULL: count:= 0:
%p for d from 1 by 2 while count < 100 do
%p m:= ceil(d/2);
%p for r from 0 to 9^m-1 do
%p L:= convert(9^m+r,base,9)[1..m] + [1$m];
%p L:= [ seq(L[-i],i=1..m-1),op(L)];
%p x:= add(L[i]*10^(i-1),i=1..d);
%p if isprime(x) and isprime((10^d-1)*10/9-x) then R:= R, x; count:= count+1
%p od od:
%p R; # _Robert Israel_, Sep 14 2020
%Y Cf. A002385 (palindromic primes).
%A _Amarnath Murthy_, Sep 23 2003
%E Corrected and extended by _David Wasserman_, Jul 18 2005