A101227 Number of solutions to equation n=x+largest digit of x, n>1.

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

Offset

2,11

Comments

In A045844, a sequence is defined by a rule a(n+1) = a(n) + largest digit of a(n); a(0) = 1. As usually in such cases, direct transformation is unique, while reverse one is not. Here the number of possible "previous" terms is given for each n.

Links

Table of n, a(n) for n=2..100.

Example

a(12)=2 because 12=6+6 and 12=11+1; a(101)=2 because 101=92+9 and 101=100+1; note offset=2.

Crossrefs

Cf. A045844.

Sequence in context: A277152 A230106 A096972 * A277162 A230103 A267602

Adjacent sequences: A101224 A101225 A101226 * A101228 A101229 A101230

Keyword

base,easy,nonn

Author

Zak Seidov, Jan 22 2005

Status

approved