A244510 a(0)=0; for n>0, choose a(n) to be the smallest number > a(n-1) such that the condition a(n) > Sum_{k=0..n} digsum(a(k)) holds.

0, 10, 11, 12, 13, 20, 21, 22, 30, 31, 32, 40, 41, 50, 60, 61, 70, 80, 90, 100, 101, 102, 103, 104, 105, 110, 111, 120, 121, 122, 130, 131, 140, 141, 150, 160, 170, 171, 180, 190, 200, 201, 202, 210, 211, 212, 220, 221, 230, 231, 240, 250, 260, 261, 270, 280

Offset

0,2

Comments

See A248893 for a binary version.

Links

Lars Blomberg, Table of n, a(n) for n = 0..10000

Eric Angelini, a(n) > cumulative sum of digits Seqfan, Nov. 11, 2014

Example

a(6)=21 because the digital sum of a(0)..a(5) is 12, and 21 is the smallest number greater than a(5)=20 and also greater than 12 + digital sum of 21.

Prog

(PARI) lista(nn) = {prec = 0; v = [0]; sdprec = 0; print1(prec, ", "); for (n=1, nn, new = prec + 1; while ((sdprec+sumdigits(new)) >= new, new ++); v = concat(v, new); print1(new, ", "); sdprec += sumdigits(new); prec = new; ); } \\ Michel Marcus, Feb 28 2015

Crossrefs

Cf. A007953, A248893.

Sequence in context: A362264 A308105 A066309 * A107860 A244156 A058948

Adjacent sequences: A244507 A244508 A244509 * A244511 A244512 A244513

Keyword

nonn,base

Author

Eric Angelini and_Bob Selcoe, Nov 15 2014

Extensions

a(28)-a(55) from Lars Blomberg, Feb 28 2015

Status

approved