A332677 a(n) is the number of ways n can be obtained by adding some digit of a number k to k.

1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 1, 2, 1, 3, 1, 3, 1, 3, 1, 3, 0, 3, 1, 2, 1, 3, 1, 3, 1, 3, 1, 2, 1, 3, 1, 2, 1, 3, 1, 3, 1, 3, 0, 3, 1, 3, 1, 2, 1, 3, 1, 3, 1, 2, 1, 3, 1, 3, 1, 2, 1, 3, 1, 3, 0, 3, 1, 3, 1, 3, 1, 2, 1, 3, 1, 2, 1, 3, 1, 3, 1, 3, 1, 2, 1, 3, 0

Offset

0,11

Comments

By definition terms cannot exceed 10. The values from 0 to 10 are obtained the first time with n = 1, 0, 10, 14, 102, 104, 1206, 12406, 124506, 1245606, and 12456806, respectively.

References

Eric Angelini, Posting to Sequence Fans Mailing List, Apr 20 2014.

Links

Table of n, a(n) for n=0..87.

Example

a(102) = 4 because 102 can written as 93+9, 96+6, 101+1, and 102+0.

Mathematica

a[n_] := Sum[ Boole[ MemberQ[ IntegerDigits[t] + t, n]], {t, Max[0, n-9], n}]; Array[a, 88, 0]

Crossrefs

Cf. A241175, A241176, A241177, A241178, A241179.

Sequence in context: A355749 A278538 A282903 * A090329 A224876 A340830

Adjacent sequences: A332674 A332675 A332676 * A332678 A332679 A332680

Keyword

nonn,base,easy

Author

Giovanni Resta, Feb 19 2020

Status

approved