%I A135187
%S A135187 9,21,45,63,117,132,140,144,190,201,204,207,220,243,264,288,315,333,402,
%T A135187 414,441,460,476,506,513,531,550,552,594,603,621,648,666,702,770,774,
%U A135187 828,846,864,880,954,999
%N A135187 Numbers n that raised to the powers from 1 to k (with k>=1) are multiple 
               of the sum of their digits (n raised to k+1 must not be a multiple). 
               Case k=2.
%e A135187 9^1=9; 9^2=81 -> Sum_digits(81)=9 is a multiple of 9.
%p A135187 readlib(log10); P:=proc(n,m) local a,i,k,w,x,ok; for i from 1 by 1 to 
               n do a:=simplify(log10(i)); if not (trunc(a)=a) then ok:=1; x:=1; 
               while ok=1 do w:=0; k:=i^x; while k>0 do w:=w+k-(trunc(k/10)*10); 
               k:=trunc(k/10); od; if trunc(i^x/w)=i^x/w then x:=x+1; else if x-1=m 
               then print(i); fi; ok:=0; fi; od; fi; od; end: P(2000,2);
%Y A135187 Cf. A135186, A135188, A135189, A135190, A135191, A135192, A135193, A135194, 
               A135195, A135196, A135197, A135198, A135199, A135200, A135201, A135202.
%Y A135187 Sequence in context: A154862 A020137 A020190 this_sequence A133762 A160414 
               A118130
%Y A135187 Adjacent sequences: A135184 A135185 A135186 this_sequence A135188 A135189 
               A135190
%K A135187 easy,nonn,base
%O A135187 1,1
%A A135187 Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Nov 22 2007