This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A168436 #8 Jan 28 2019 02:25:16
%S A168436 987653201,987652301,987650231,987643021,987640321,987630251,
%T A168436 987615203,987603521,987602531,987563021,987546103,987542063,
%U A168436 987540613,987536201,987526103,987502643,987460531,987435061,987432601,987423601,987405163
%N A168436 Terms of A046732 listed in decreasing order.
%p A168436 read("transforms") ; ndgs := proc(n) max(1, ilog10(n)+1) ; end proc: isA029743 := proc(n) dgs := convert(convert(n,base,10),set) ; return ( nops(dgs) = ndgs(n) ); end proc: isA006567 := proc(n) if isprime(n) then dgs := digrev(n) ; return (isprime(dgs) and dgs <> n ); else false; end if; end proc: p := 987654321 : while true do if isA006567(p) and isA029743(p) then printf("%d,\n",p) ; end if: p := prevprime(p) ; end do: # _R. J. Mathar_, Mar 06 2010
%Y A168436 Cf. A046732.
%K A168436 fini,nonn,base
%O A168436 1,1
%A A168436 _Lekraj Beedassy_, Nov 25 2009
%E A168436 a(6) and a(7) inserted and sequence extended by _R. J. Mathar_, Mar 06 2010