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 A235691 #12 Apr 29 2014 22:49:29
%S A235691 106,123,129,134,142,143,145,146,158,159,169,178,183,185,187,194,201,
%T A235691 203,205,206,209,213,214,215,217,218,219,235,237,247,249,253,254,259,
%U A235691 265,267,274,278,287,289,291,295,298,301,302,305,309,314,319,321,326,327
%N A235691 Semiprimes which have one or more occurrences of exactly three different digits.
%C A235691 The first term having a repeated digit is 1003.
%e A235691 91119111691966691969 is a term, because it is made of the 3 digits {1, 6, 9} and is the product of two primes 9397848521 and 9695741689. - _Giovanni Resta_, Jan 14 2014
%t A235691 Select[Range@999, Length@ Union@ IntegerDigits[#] == 3 && Total[Last /@ FactorInteger[#]] == 2 &] (* _Giovanni Resta_, Jan 14 2014 *)
%o A235691 (PARI)
%o A235691 list(lim)=my(v=List(), t); forprime(p=2, sqrt(lim), t=p; forprime(q=p, lim\t, listput(v, t*q))); vecsort(Vec(v)) \\ From A001358
%o A235691 b=list(10000); s=[]; for(n=1, #b, if(#vecsort(eval(Vec(Str(b[n]))),,8)==3, s=concat(s, b[n]))); s
%Y A235691 Cf. A235690, A235692-A235696.
%Y A235691 Cf. A235154-A235161.
%K A235691 nonn,base
%O A235691 1,1
%A A235691 _Colin Barker_, Jan 14 2014