id:A037968 - OEIS Search Results

Search: id:A037968

Displaying 1-1 of 1 results found.

page 1

Greatest number of digits of n in any base b>=2.

+0
3

1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 3, 3, 2, 3, 2, 2, 3, 2, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(A049363(n)) = n and a(m) < n for m < A049363(n). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 27 2003`
	CROSSREFS	`See A037914 for the least corresponding bases.` `Sequence in context: A103378 A103663 A083311 this_sequence A074908 A151963 A111858` `Adjacent sequences: A037965 A037966 A037967 this_sequence A037969 A037970 A037971`
	KEYWORD	`nonn,base`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 7 23:50 EST 2009. Contains 170430 sequences.

AT&T Labs Research