%I A061862
%S A061862 0,1,2,3,4,5,6,7,8,9,24,43,63,89,132,135,153,175,209,224,226,254,258,
%T A061862 262,263,264,267,283,332,333,334,347,357,370,371,372,373,374,375,376,
%U A061862 377,378,379,407,445,463,472,518,538,598,629,635,653,675,730,731,732
%N A061862 Powerful numbers (2a): a sum of nonnegative powers of its digits.
%C A061862 Zero digits cannot be used in the sum. - N. J. A. Sloane, Aug 31 2009
%H A061862 D. Wilson, <a href="b061862.txt">Table of n, a(n) for n=1..10000</a>
%H A061862 <a href="Sindx_Pow.html#powerful">Index entries for sequences related 
               to powerful numbers</a>
%F A061862 If n = d_1 d_2 ... d_k in decimal then there are integers m_1 m_2 ... 
               m_k >= 0 such that n = d_1^m_1 + ... + d_k^m_k.
%e A061862 43 = 4^2 + 3^3; 254 = 2^7 + 5^3 + 4^0 = 128 + 125 + 1.
%e A061862 209 = 2^7 + 9^2.
%e A061862 732 = 7^0 + 3^6 + 2^1.
%t A061862 f[ n_ ] := Module[ {}, a=IntegerDigits[ n ]; e=g[ Length[ a ] ]; MemberQ[ 
               Map[ Apply[ Plus, a^# ] &, e ], n ] ] g[ n_ ] := Map[ Take[ Table[ 
               0, {n} ]~Join~#, -n ] &, IntegerDigits[ Range[ 10^n ], 10 ] ] For[ 
               n=0, n >= 0, n++, If[ f[ n ], Print[ n ] ] ]
%Y A061862 Cf. A001694, A005934, A005188, A003321, A014576, A023052, A046074.
%Y A061862 Different from A007532 and A134703, which are variations.
%Y A061862 Sequence in context: A116960 A126957 A134703 this_sequence A007532 A068189 
               A069716
%Y A061862 Adjacent sequences: A061859 A061860 A061861 this_sequence A061863 A061864 
               A061865
%K A061862 base,nonn
%O A061862 1,3
%A A061862 Erich Friedman (efriedma(AT)stetson.edu), Jun 23 2001