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 A106099 #9 Jan 02 2019 03:45:55 %S A106099 3,13,23,31,103,113,131,223,233,311,313,331,1013,1031,1033,1103,1123, %T A106099 1213,1223,1231,1301,1303,1321,2003,2113,2131,2203,2213,2311,2333, %U A106099 3001,3011,3023,3121,3203,3221,3301,3313,3323,3331 %N A106099 Primes with maximal digit = 3. %H A106099 Robert Israel, <a href="/A106099/b106099.txt">Table of n, a(n) for n = 1..10000</a> %p A106099 Res:= 3: count:= 1: %p A106099 A:= {3}: B:= {$1..2}: %p A106099 for d from 2 while count < 100 do %p A106099 A:= {seq(seq(10*a+i,i=0..3),a=A), seq(10*b+3,b=B)}: %p A106099 B:= {seq(seq(10*b+i,i=0..2),b=B)}: %p A106099 S:= sort(convert(select(isprime,A),list)); %p A106099 count:= count + nops(S); %p A106099 Res:= Res, op(S); %p A106099 od: %p A106099 Res; # _Robert Israel_, Jan 01 2019 %t A106099 Select[Prime[Range[600]], Max[IntegerDigits[ # ]]==3&] %Y A106099 Cf. A106093, A106094, A106095, A106096, A106097, A106098, A106100. %K A106099 nonn,base %O A106099 1,1 %A A106099 _Zak Seidov_, May 07 2005