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 A037968 #25 Sep 15 2014 03:52:44
%S A037968 1,2,2,2,2,2,2,2,2,2,3,2,2,2,3,2,2,3,3,2,3,2,2,3,2,2,3,3,3,3,2,3,3,3,
%T A037968 3,3,2,3,3,3,3,3,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,
%U A037968 3,3,3,3,3,3,4,3,3,4,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4,3,3,3,3,3,3
%N A037968 Greatest number of distinct digits of n in any base b>=2.
%C A037968 a(A049363(n)) = n and a(m) < n for m < A049363(n). - _Reinhard Zumkeller_, Oct 27 2003
%C A037968 From _Robert G. Wilson v_, Aug 29 2014: (Start)
%C A037968 First occurrence of k: 1, 2, 11, 75, 694, 8345, 123717, …, . A049363
%C A037968 Last occurrence of k: 1, 43, 2462, 140081, 20338085, …, . A246535
%C A037968 Count of f(j) = k: 1, 22, 340, 8888, …, . not in the OEIS data base.
%C A037968 (End)
%H A037968 Robert G. Wilson v, <a href="/A037968/b037968.txt">Table of n, a(n) for n = 1..1000</a>
%t A037968 f[n_] := Max@ Table[ Length@ Union@ IntegerDigits[n, b], {b, 2, n }]; f[1] = 1; Array[f, 105] (* _Robert G. Wilson v_, Aug 29 2014 *)
%o A037968 (PARI) a(n) = {nb = 1; for (k=2, n, nb = max (nb, #Set(digits(n, k)));); nb;} \\ _Michel Marcus_, Sep 13 2014
%Y A037968 See A037914 for the least corresponding bases.
%K A037968 nonn,base
%O A037968 1,2
%A A037968 _Clark Kimberling_