id:A037914 - OEIS Search Results

Search: id:A037914

Displaying 1-1 of 1 results found.

page 1

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.

+0
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 (list; graph; listen)

	OFFSET	`2,1`
	CROSSREFS	`See A037968 for the greatest number of digits over all bases b>=2.` `Adjacent sequences: A037911 A037912 A037913 this_sequence A037915 A037916 A037917` `Sequence in context: A134852 A071188 A123582 this_sequence A073813 A104517 A098397`
	KEYWORD	`nonn,base`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified October 13 02:37 EDT 2008. Contains 145008 sequences.

AT&T Labs Research