Search: id:A037968
Results 1-1 of 1 results found.

%I A037968
%S A037968 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,
%T A037968 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,
%U A037968 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
%N A037968 Greatest number of digits of n in any base b>=2.
%C A037968 a(A049363(n)) = n and a(m) < n for m < A049363(n). - Reinhard Zumkeller 
               (reinhard.zumkeller(AT)gmail.com), Oct 27 2003
%Y A037968 See A037914 for the least corresponding bases.
%Y A037968 Sequence in context: A103378 A103663 A083311 this_sequence A074908 A151963 
               A111858
%Y A037968 Adjacent sequences: A037965 A037966 A037967 this_sequence A037969 A037970 
               A037971
%K A037968 nonn,base
%O A037968 1,2
%A A037968 Clark Kimberling (ck6(AT)evansville.edu)

Search completed in 0.001 seconds