cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A067043 #11 Jul 13 2013 12:02:42
%S A067043 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 A067043 98,99,189,198,199,289,298,299,389,398,399,489,498,499,589,598,599,
%U A067043 689,698,699,789,798,799,889,898,899,989,998
%N 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.
%C A067043 A138472(a(n)) = 0. - _Reinhard Zumkeller_, Mar 19 2008
%C A067043 Positions of records in A048377: A192686(n) = A048377(a(n)). [_Reinhard Zumkeller_, Jul 10 2011]
%H A067043 Reinhard Zumkeller, <a href="/A067043/b067043.txt">Table of n, a(n) for n = 0..10000</a>
%o A067043 (Haskell)
%o A067043 a067043 n = a067043_list !! n
%o A067043 a067043_list = 0 : f 1 1 0 1 where
%o A067043    f k x y z
%o A067043      | y > 0     = (x-y) : f k x (y `div` 10) z
%o A067043      | k < 9     = x : f (k+1) (2*x-k*z+1) (z `div` 10) z
%o A067043      | otherwise = x : f 1 (20*z-1) z (10*z)
%o A067043 -- _Reinhard Zumkeller_, Jul 10 2011
%Y A067043 Cf. A007953, A051885.
%K A067043 nonn,base
%O A067043 0,3
%A A067043 _Reinhard Zumkeller_, Feb 17 2002