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”).
%I #15 Jul 07 2024 21:03:41
%S 2,5,11,17,37,41,101,251,401,491,641,811,977,1009,1301,1459,1601,1613,
%T 2269,2297,2521,4001,4357,4931,5741,5849,8101,9001,10891,12071,12101,
%U 13001,14621,16001,17291,19441,22961,23633,26681,27011,30493,31541,34781,38153,42283,42751,46061,58481,66457
%N Primes that can be represented as k*R(k) + 1, where R(k) is the reverse of k.
%C Values of the primes corresponding to A073805, sorted and with duplicates removed.
%C Most terms can be obtained in two ways, corresponding to x * R(x) + 1 and R(x) * x + 1 or more generally (10^i * x) * R(x) + 1 and (10^i * R(x)) * x + 1, where R(x) <> x and x doesn't end in 0 so R(R(x)) = x. The first term that can be obtained in four ways is 1015561 = 1560 * 651 + 1 = 2730 * 372 + 1 = 3720 * 273 + 1 = 6510 * 156 + 1.
%H Robert Israel, <a href="/A372197/b372197.txt">Table of n, a(n) for n = 1..10000</a>
%e a(1) = 2 = 1 * 1 + 1.
%e a(3) = 11 = 10 * 1 + 1.
%e a(13) = 977 = 16 * 61 + 1.
%p N:= 6: # for terms <= 10^N where N is even
%p S:= {}:
%p for x from 1 to 10^(N/2)-1 do
%p if x mod 10 = 0 then next fi;
%p r:= rev(x);
%p if r < x then next fi;
%p v:= x*r;
%p for i from 0 do
%p w:= 10^i*v+1;
%p if w > 10^N then break fi;
%p if isprime(w) then S:= S union {w} fi;
%p od
%p od:
%p sort(convert(S,list));
%Y Cf. A004086, A073805.
%K nonn,base
%O 1,1
%A _Robert Israel_, Jul 03 2024