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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A130692 a(n) is the smallest number m such that the sum of the digits of n+m is n. 0
 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 18, 27, 36, 45, 54, 63, 72, 81, 180, 279, 378, 477, 576, 675, 774, 873, 972, 1971, 2970, 3969, 4968, 5967, 6966, 7965, 8964, 9963, 19962, 29961, 39960, 49959, 59958, 69957, 79956, 89955, 99954, 199953, 299952, 399951 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,10 COMMENTS All the numbers are divisible by 9. LINKS Table of n, a(n) for n=0..47. EXAMPLE a(17) = 72 because 89 is the smallest number having digit sum 17 and 17+ 72=89. MATHEMATICA a[n_] := Module[{k}, k=0; While[Not[Plus@@IntegerDigits[n + k] == n], k = k + 9]; k]; Table[a[n], {n, 1, 50}] CROSSREFS Sequence in context: A044052 A131418 A249605 * A043453 A028439 A178896 Adjacent sequences: A130689 A130690 A130691 * A130693 A130694 A130695 KEYWORD base,easy,nonn AUTHOR Paolo P. Lava and Giorgio Balzarotti, Jul 09 2007 EXTENSIONS Edited by Stefan Steinerberger, Jul 14 2007 STATUS approved

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.

Last modified May 30 14:11 EDT 2023. Contains 363055 sequences. (Running on oeis4.)