|
| |
|
|
A101227
|
|
Number of solutions to equation n=x+largest digit of x, n>1.
|
|
0
| |
|
|
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
(list; graph; refs; listen; history; internal format)
|
|
|
|
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.
|
|
|
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: A172444 A026611 A096972 * A021499 A176742 A010673
Adjacent sequences: A101224 A101225 A101226 * A101228 A101229 A101230
|
|
|
KEYWORD
| base,easy,nonn
|
|
|
AUTHOR
| Zak Seidov (zakseidov(AT)yahoo.com), Jan 22 2005
|
| |
|
|
