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 A179033 #17 Jun 03 2016 02:43:37 %S A179033 1021,1201,1249,1429,9029,9209,9241,9421,10429,11621,12109,12119, %T A179033 12149,12491,12611,12619,12641,12689,12809,12841,12919,14029,14621, %U A179033 14629,14821,14929,16249,16829,18269,19219,19249,19421,90121,90821,91121 %N A179033 Emirps with a single 2 as the only prime digit. %H A179033 Robert Israel, <a href="/A179033/b179033.txt">Table of n, a(n) for n = 1..10000</a> %e A179033 Note that 2 and 929 are not emirps because they are palindromes. %p A179033 Dmax:= 6: # to get all terms with up to Dmax digits %p A179033 Res:= NULL: %p A179033 npd:= [0,1,4,6,8,9]: %p A179033 for dd from 3 to Dmax do %p A179033 R:= [seq(seq([seq(npd[j+1],j=convert(6*x+j,base,6))], %p A179033 x=[$6^(dd-3) .. 2*6^(dd-3)-1, $5*6^(dd-3)..6^(dd-2)-1]),j=[1,5])]; %p A179033 for p from 2 to dd-1 do %p A179033 for r in R do %p A179033 x:= [op(r[1..p-1]),2,op(r[p..-1])]; %p A179033 v1:= add(x[i]*10^(i-1),i=1..dd); %p A179033 v2:= add(x[-i]*10^(i-1),i=1..dd); %p A179033 if v1 < v2 and isprime(v1) and isprime(v2) then Res:= Res,v1,v2; if min(v1,v2) < 10^3 then print(dd,p,r,x,v1,v2) fi fi %p A179033 od od od: %p A179033 sort([Res]); # _Robert Israel_, Jun 02 2016 %t A179033 emrp[n_]:=Module[{idn=IntegerDigits[n],rev},rev=Reverse[idn];PrimeQ[FromDigits[rev]]&&rev!=idn] %t A179033 only2[n_]:=DigitCount[n,10,{3,5,7}]=={0,0,0}&&DigitCount[n,10,2]==1 %t A179033 Select[Select[Prime[Range[10000]],emrp],only2] (* _Harvey P. Dale_, Jan 22 2011 *) %Y A179033 Cf. A006567, A179032. %K A179033 base,less,nonn %O A179033 1,1 %A A179033 _Lekraj Beedassy_, Jun 25 2010 %E A179033 Terms confirmed by _Ray Chandler_, Jul 13 2010 %E A179033 Definition improved by _Harvey P. Dale_, Jul 17 2010