A037968 - OEIS

This site is supported by donations to The OEIS Foundation.

A037968

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

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; refs; listen; history; internal format)

	OFFSET	`1,2`
	COMMENTS	`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 * A074908 A151963 A191291` `Adjacent sequences: A037965 A037966 A037967 * A037969 A037970 A037971`
	KEYWORD	`nonn,base`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:51 EST 2012. Contains 205978 sequences.