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 A224792 #26 Aug 28 2014 10:32:42
%S A224792 0,1,2,3,13,113,1113,11113,1011113,101011113,1101111211,110101111211,
%T A224792 100110101111211,10101010101101122,1011111111100000013,
%U A224792 1010111111111000000022,111000010111000111111111,1010110111101110100000011111,1111111110010101100001100000102
%N A224792 Smallest skinny number (A061909) with digit sum n.
%C A224792 The smallest m >= 0 with sum of digits of (m) = n and sum of digits of (m^2) = (sum of digits of (m))^2.
%C A224792 There are infinitely many natural numbers m >= 0 with sum of digits of (m) = n and sum of digits of (m^2) = (sum of digits of (m))^2.
%H A224792 Hiroaki Yamanouchi, <a href="/A224792/b224792.txt">Table of n, a(n) for n = 0..19</a>
%F A224792 a(n) > 2/9 * 10^(n/2) for n > 4. - _Charles R Greathouse IV_, Apr 18 2013
%t A224792 DS[n_] := Total[IntegerDigits[n]]; nn = 10; t = Table[0, {nn}]; n = 0; found = 0; While[n++; r = FromDigits[IntegerDigits[n, 4]]; found < nn, If[DS[r]^2 == DS[r^2] && DS[r] <= nn && t[[DS[r]]] == 0, t[[DS[r]]] = r; found++; Print[r]]]; Join[{0}, t] (* _T. D. Noe_, Apr 18 2013 *)
%Y A224792 Cf. A061909.
%K A224792 nonn,base
%O A224792 0,3
%A A224792 _Reiner Moewald_, Apr 18 2013
%E A224792 a(10) corrected and a(11) added by _T. D. Noe_, Apr 18 2013
%E A224792 a(12)-a(13) from _Donovan Johnson_, Apr 19 2013
%E A224792 a(14) from _Donovan Johnson_, Apr 24 2013
%E A224792 a(15)-a(18) from _Hiroaki Yamanouchi_, Aug 28 2014