This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A101227 #3 Mar 30 2012 17:26:10 %S A101227 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, %T A101227 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, %U A101227 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 %N A101227 Number of solutions to equation n=x+largest digit of x, n>1. %C A101227 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. %e A101227 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. %Y A101227 Cf. A045844. %K A101227 base,easy,nonn %O A101227 2,11 %A A101227 _Zak Seidov_, Jan 22 2005