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 A239348 #19 Mar 19 2014 04:10:57
%S A239348 0,1,2,3,4,5,6,7,8,9,10,12,13,14,16,17,18,20,22,23,24,25,26,27,28,30,
%T A239348 31,36,37,39,40,41,43,44,49,50,52,53,54,56,60,62,67,68,70,71,72,74,76,
%U A239348 77,79,80,81,82,84,85,90,91,93,94,109,111,112,117,118,121,122,124
%N A239348 Numbers that are not pandigital in any base b >= 3.
%C A239348 Identical to A154314 until a(51).
%H A239348 Joonas Pohjonen, <a href="/A239348/b239348.txt">Table of n, a(n) for n = 1..10000</a>
%F A239348 a(n) >> n^1.58..., where the exponent is log(3)/log(2). - _Charles R Greathouse IV_, Mar 17 2014
%e A239348 11 is not in the sequence because 11 = 102_3.
%t A239348 nop[n_] := Block[{b=3, d}, While[ Length[d = IntegerDigits[n, b]] >= b && Union[d] != Range[0, b-1], b++]; Length[d] < b]; Select[Range[0, 124], nop] (* _Giovanni Resta_, Mar 17 2014 *)
%o A239348 (PARI) isok(n) = {for (b = 3, n, d = digits(n, b); if (#vecsort(d,,8) == b, return(0));); return (1);} \\ _Michel Marcus_, Mar 17 2014
%o A239348 (PARI) is(n)=for(b=3,log(n)\lambertw(log(n))+1, if(#Set(digits(n,b))==b, return(0))); 1 \\ _Charles R Greathouse IV_, Mar 17 2014
%Y A239348 Cf. A154314.
%K A239348 nonn,base
%O A239348 1,3
%A A239348 _Joonas Pohjonen_, Mar 16 2014