%I A038178
%S A038178 0,1,2,3,4,5,6,7,8,9,81,512,2401
%N A038178 n = (sum of digits of n)^(number of digits of n).
%C A038178 Subset of A023106. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Oct 20 2008]
%F A038178 a(n) = (1/10)*(n-(n mod 10))*(729*n^2-14879*n+75971)+(n mod 10) - Rolf 
               Pleisch (r_pleisch(AT)gmx.ch), Feb 06 2008
%e A038178 n=512 is OK because (5+1+2)^3 = 512.
%Y A038178 Sequence in context: A024662 A153670 A024663 this_sequence A023106 A135480 
               A098766
%Y A038178 Adjacent sequences: A038175 A038176 A038177 this_sequence A038179 A038180 
               A038181
%K A038178 nonn,nice,fini,full,base
%O A038178 0,3
%A A038178 Felice Russo (felice.russo(AT)katamail.com)
%E A038178 To prove completeness, consider that k^m contains more than m digits 
               for every k >= 10 and check 1<=k<=9 explicitly - Ulrich Schimke (UlrSchimke(AT)aol.com)