login
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.
2
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, 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, 3, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 5, 6, 4, 3, 5, 5, 3, 3, 3, 3, 6
OFFSET
1,1
COMMENTS
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.
LINKS
Sean A. Irvine, Java program (github).
CROSSREFS
See A037968 for the greatest number of digits over all bases b>=2.
Sequence in context: A374383 A123582 A214861 * A073813 A104517 A098397
KEYWORD
nonn,base
EXTENSIONS
Offset corrected and title simplified by Sean A. Irvine, Dec 27 2020
STATUS
approved