A067043 Nondecreasing sums of digits: a(0) = 0 and for n>0: a(n) = Min{m>n|SumOfDigits(m)>= SumOfDigits(a(n-1))}, where SumOfDigits = A007953.

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 18, 19, 28, 29, 38, 39, 48, 49, 58, 59, 68, 69, 78, 79, 88, 89, 98, 99, 189, 198, 199, 289, 298, 299, 389, 398, 399, 489, 498, 499, 589, 598, 599, 689, 698, 699, 789, 798, 799, 889, 898, 899, 989, 998

Offset: 0

Author

Reinhard Zumkeller, Feb 17 2002

Keywords

• nonn
• base

Comments

A138472(a(n)) = 0. - Reinhard Zumkeller, Mar 19 2008

Positions of records in A048377: A192686(n) = A048377(a(n)). [Reinhard Zumkeller, Jul 10 2011]

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 0..10000

Crossrefs

Cf. A007953, A051885.

Programs

Haskell

a067043 n = a067043_list !! n
a067043_list = 0 : f 1 1 0 1 where
   f k x y z
     | y > 0     = (x-y) : f k x (y `div` 10) z
     | k < 9     = x : f (k+1) (2*x-k*z+1) (z `div` 10) z
     | otherwise = x : f 1 (20*z-1) z (10*z)
-- Reinhard Zumkeller, Jul 10 2011