The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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; text; 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. 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 20 12:18 EDT 2024. Contains 372712 sequences. (Running on oeis4.)