login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #11 Jul 13 2013 12:02:42

%S 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,

%T 98,99,189,198,199,289,298,299,389,398,399,489,498,499,589,598,599,

%U 689,698,699,789,798,799,889,898,899,989,998

%N 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.

%C A138472(a(n)) = 0. - _Reinhard Zumkeller_, Mar 19 2008

%C Positions of records in A048377: A192686(n) = A048377(a(n)). [_Reinhard Zumkeller_, Jul 10 2011]

%H Reinhard Zumkeller, <a href="/A067043/b067043.txt">Table of n, a(n) for n = 0..10000</a>

%o (Haskell)

%o a067043 n = a067043_list !! n

%o a067043_list = 0 : f 1 1 0 1 where

%o f k x y z

%o | y > 0 = (x-y) : f k x (y `div` 10) z

%o | k < 9 = x : f (k+1) (2*x-k*z+1) (z `div` 10) z

%o | otherwise = x : f 1 (20*z-1) z (10*z)

%o -- _Reinhard Zumkeller_, Jul 10 2011

%Y Cf. A007953, A051885.

%K nonn,base

%O 0,3

%A _Reinhard Zumkeller_, Feb 17 2002

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)