|
%I #14 Jun 06 2017 06:20:00
%S 1,2,11,29,38,47,56,65,74,83,92,119,128,137,2999,3899,3989,3998,4799,
%T 4889,4898,4979,4988,4997,5699,5789,5798,5879,5888,5897,5969,5978,
%U 5987,5996,6599,6689,6698,6779,6788,6797,6869,6878,6887,29999
%N a(n) integers with digit sum a(n); a(n+1) is the smallest integer > a(n).
%C A self-describing sequence (from the digit sum point of view).
%H John Cerkan, <a href="/A136317/b136317.txt">Table of n, a(n) for n = 1..5000</a>
%H John Cerkan, <a href="/A136317/a136317.py.txt">Python 2.7 program</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/DigitSum.html">Digit Sum</a>
%e The two number-columns hereunder are the sequence itself:
%e 1 integer with digit sum 1 followed by
%e 2 integers with digit sum 2 followed by
%e 11 integers with digit sum 11 followed by
%e 29 integers with digit sum 29 followed by
%e 38 integers with digit sum 38 followed by
%e 47 integers with digit sum 47, etc.
%K base,easy,nonn,uned
%O 1,2
%A _Eric Angelini_, Mar 24 2008
%E a(28) inserted by _John Cerkan_, Jun 06 2017
|
