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