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 A133753 #11 Sep 15 2024 16:35:48
%S A133753 73,733,3733,7253,7523,7757,33223,35323,72253,72353,73327,73523,73553,
%T A133753 75223,75253,77237,77323,77527,77557,333323,352333,355723,375223,
%U A133753 375233,375553,722333,727327,733333,735733,737353,737753,737773,753373,753527,772273,773273,775757,777353,777373
%N A133753 Larger of emirps (pairs) with only prime digits (A128388).
%H A133753 Harvey P. Dale, <a href="/A133753/b133753.txt">Table of n, a(n) for n = 1..1000</a>
%F A133753 {p in A128388: p> A004086(p)}. - _R. J. Mathar_, Jan 30 2008
%p A133753 read(transforms) : isA006567 := proc(n) local digs,prev ; if isprime(n) then prev := digrev(n) ; if n <> prev and isprime(prev) then true ; else false ; fi ; else false ; fi ; end: isA128388 := proc(n) local digs ; if isA006567(n) then digs := convert(convert(n,base,10),set) ; if digs minus {2,3,5,7} = {} then true ; else false ; fi ; else false ; fi ; end: isA133753 := proc(n) if isA128388(n) then if digrev(n) < n then true; else false ; fi ; else false ; fi ; end: for n from 1 to 200000 do p := ithprime(n) ; if isA133753(p) then printf("%d, ",p) ; fi ; od: # _R. J. Mathar_, Jan 30 2008
%t A133753 Select[(Table[(Sort/@Select[{#,IntegerReverse[#]}&/@Select[FromDigits/@Tuples[ {2,3,5,7},n],PrimeQ],AllTrue[#,PrimeQ]&])[[;;,2]]//Union,{n,2,6}]//Flatten//Union),!PalindromeQ[#]&] (* _Harvey P. Dale_, Sep 15 2024 *)
%Y A133753 Cf. A128388, A133554.
%K A133753 nonn,base
%O A133753 1,1
%A A133753 _Lekraj Beedassy_, Jan 21 2008
%E A133753 Extended by _Ray Chandler_ and _R. J. Mathar_, Jan 30 2008