login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A037914 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. 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

LINKS

Table of n, a(n) for n=2..91.

CROSSREFS

See A037968 for the greatest number of digits over all bases b>=2.

Sequence in context: A278966 A123582 A214861 * A073813 A104517 A098397

Adjacent sequences:  A037911 A037912 A037913 * A037915 A037916 A037917

KEYWORD

nonn,base

AUTHOR

Clark Kimberling

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 19 22:34 EST 2019. Contains 329323 sequences. (Running on oeis4.)