This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 5
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 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 PROG (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 CROSSREFS Cf. A007953, A051885. Sequence in context: A032864 A032888 A023791 * A108690 A032944 A273736 Adjacent sequences:  A067040 A067041 A067042 * A067044 A067045 A067046 KEYWORD nonn,base AUTHOR Reinhard Zumkeller, Feb 17 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 8 08:49 EST 2019. Contains 329862 sequences. (Running on oeis4.)