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 A037914 #9 Dec 28 2020 02:51:49 %S A037914 2,2,3,2,2,2,3,2,2,2,3,2,2,2,3,2,2,4,3,2,3,2,2,4,2,2,4,4,3,4,3,3,3,3, %T A037914 3,4,2,3,4,5,6,3,2,4,3,3,3,3,4,4,3,4,5,4,3,4,3,3,3,6,3,6,3,3,3,3,4,6, %U A037914 3,4,4,4,3,4,4,4,4,4,4,5,6,4,3,5,5,3,3,3,3,6 %N A037914 a(n) is the least base b>=2 such that the number of distinct digits in the base b representation of n is maximized. %C A037914 Original title: a(n)=least base b>=2 such that f(b,n)>=f(b',n) for all b'>=2, where f(b,n)=number of distinct base b digits of n. %H A037914 Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a037/A037914.java">Java program</a> (github). %Y A037914 See A037968 for the greatest number of digits over all bases b>=2. %K A037914 nonn,base %O A037914 1,1 %A A037914 _Clark Kimberling_ %E A037914 Offset corrected and title simplified by _Sean A. Irvine_, Dec 27 2020