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 A173595 #5 Jan 27 2019 20:29:27
%S A173595 113,199,337,1151,1181,3343,3373,7177,7577,11161,77797,98999,111119,
%T A173595 111211,323333,333337,333433,777787,777877,991999,1111711,3333373,
%U A173595 9929999,11111117,11111911,11113111
%N A173595 The smaller member of a near-repdigit emirp pair.
%C A173595 a(n) and an associated A173596 = A004086(a(n)) are a near-repdigit emirp pair, and all these pairs united, sorted, generate A173594.
%e A173595 a(3) = 337 and A173596(2) = 733 are an emirp pair using only two different digits.
%p A173595 read("transforms") ; isA164937 := proc(n) local dse ; if isprime(n) and n > 100 then dse := convert(convert(n,base,10),multiset) ; if nops(dse) = 2 then op(2,op(1,dse)) = 1 and op(2,op(2,dse)) > 1 or op(2,op(1,dse)) > 1 and op(2,op(2,dse)) = 1; else false; end if ; else false; end if; end proc:
%p A173595 isA006567 := proc(n) if isprime(n) then pr := digrev(n) ; return isprime(pr) and pr <> n ; else false; end if; end proc:
%p A173595 isA173594 := proc(n) isA164937(n) and isA006567(n) ; end proc:
%p A173595 isA173595 := proc(n) return isA173594(n) and digrev(n) > n end proc:
%p A173595 for n from 2 do if isA173595(n) then printf("%d,",n) ; fi ; end do ; # _R. J. Mathar_, Mar 05 2010
%Y A173595 Cf. A173594, A173596.
%K A173595 base,nonn
%O A173595 1,1
%A A173595 _Lekraj Beedassy_, Feb 22 2010
%E A173595 Keyword:base added by _R. J. Mathar_, Feb 24 2010, Mar 05 2010