This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A096234 Base 10 "digit addition generators": a(n) = smallest m such that m + (sum of digits of m) = n, or 0 if no such m exists. 1
 0, 1, 0, 2, 0, 3, 0, 4, 0, 5, 10, 6, 11, 7, 12, 8, 13, 9, 14, 0, 15, 20, 16, 21, 17, 22, 18, 23, 19, 24, 0, 25, 30, 26, 31, 27, 32, 28, 33, 29, 34, 0, 35, 40, 36, 41, 37, 42, 38, 43, 39, 44, 0, 45, 50, 46, 51, 47, 52, 48, 53, 49, 54, 0, 55, 60, 56, 61, 57, 62 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS The zeros in this sequence correspond to A003052, the self numbers. This sequence has several terms in common with A025804, expansion of 1/((1-x^2)(1-x^4)(1-x^9)). a(25) to a(34) of that sequence are equal to a(10) to a(19) of this one. There are 102 zeros in the first 1000 terms and 983 zeros in the first 10000 terms. - Harvey P. Dale, Feb 22 2016 LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 Eric Weisstein's World of Mathematics, Digit Addition Generator. EXAMPLE a(29) = 19 because 19 + (1 + 9) = 29 a(30) = 24 because 24 + (2 + 4) = 30 a(31) = 0 because there is no integer that added to its digits results in 31 MATHEMATICA msodm[n_]:=Module[{m=n-9*IntegerLength[n]}, While[m+Total[ IntegerDigits[ m]] != n&&m

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 October 17 04:09 EDT 2019. Contains 328106 sequences. (Running on oeis4.)