%I A052010
%S A052010 0,0,2,2,2,2,2,2,2,2,0,0,4,3,2,2,2,2,2,2,5,5,4,3,3,2,2,2,2,2,4,4,3,3,3,
%T A052010 3,2,2,2,2,3,3,3,3,3,3,2,2,2,2,3,3,3,3,3,3,2,2,2,2,3,3,3,3,3,3,2,2,2,2,
%U A052010 3,3,3,3,3,3,2,2,2,2,3,3,3,3,3,2,2,2,2,2,3,3,3,3,2,2,2,2,2,2,0,0,7,5,4
%N A052010 Smallest k such that the sum of the digits of n each raised to k-th power 
               is greater than n, or 0 if no such k exists.
%e A052010 E.g. 103 needs k at least equal to 5 because 1^5+0^5+3^5 = 244 > 103.
%Y A052010 Sequence in context: A037815 A117005 A115230 this_sequence A138471 A102669 
               A055098
%Y A052010 Adjacent sequences: A052007 A052008 A052009 this_sequence A052011 A052012 
               A052013
%K A052010 nonn,base
%O A052010 0,3
%A A052010 Patrick De Geest (pdg(AT)worldofnumbers.com), Nov 15 1999.