This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A134703 #12 Feb 26 2013 12:14:22 %S A134703 0,1,2,3,4,5,6,7,8,9,24,43,63,89,132,135,153,175,209,224,226,254,258, %T A134703 262,263,264,267,283,308,332,333,334,347,357,370,371,372,373,374,375, %U A134703 376,377,378,379,407,445,463,472,518,538,598,629,635,653,675,730,731,732,733,734 %N A134703 Powerful numbers (2b): a sum of nonnegative powers of its digits. %C A134703 Here 0 digits may be used, with the convention that 0^0 = 1. Of course 0^1 = 0, so one is free to use the 0 digit to get an extra 1, or not. %H A134703 David Wilson, <a href="/A134703/b134703.txt">Table of n, a(n) for n = 1..10000</a> %H A134703 <a href="/index/Pow#powerful">Index entries for sequences related to powerful numbers</a> %F A134703 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 A134703 43 = 4^2 + 3^3; 254 = 2^7 + 5^3 + 4^0 = 128 + 125 + 1. %e A134703 209 = 2^7 + 0^1 + 9^2. %e A134703 732 = 7^0 + 3^6 + 2^1. %Y A134703 Cf. A001694, A005934, A005188, A003321, A014576, A023052, A046074. %Y A134703 Different from A007532 and A061862, which are variations. %K A134703 base,nonn %O A134703 1,3 %A A134703 _David W. Wilson_, Sep 05 2009