|
Search: id:A130692
|
|
|
| A130692 |
|
a(n) is the smallest number m such that the sum of the digits of n+m is n. |
|
+0
1
|
|
| 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; listen)
|
|
|
OFFSET
|
0,10
|
|
|
COMMENT
|
All the numbers are divisible by 9.
|
|
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
|
Adjacent sequences: A130689 A130690 A130691 this_sequence A130693 A130694 A130695
Sequence in context: A111708 A044052 A131418 this_sequence A043453 A028439 A033021
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Jul 09 2007
|
|
EXTENSIONS
|
Edited by Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jul 14 2007
|
|
|
Search completed in 0.002 seconds
|
