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 A332677 #7 Feb 19 2020 11:24:30
%S A332677 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,
%T A332677 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,
%U A332677 3,1,3,1,2,1,3,1,2,1,3,1,3,1,3,1,2,1,3,0
%N A332677 a(n) is the number of ways n can be obtained by adding some digit of a number k to k.
%C A332677 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.
%D A332677 Eric Angelini, Posting to Sequence Fans Mailing List, Apr 20 2014.
%e A332677 a(102) = 4 because 102 can written as 93+9, 96+6, 101+1, and 102+0.
%t A332677 a[n_] := Sum[ Boole[ MemberQ[ IntegerDigits[t] + t, n]], {t, Max[0, n-9], n}]; Array[a, 88, 0]
%Y A332677 Cf. A241175, A241176, A241177, A241178, A241179.
%K A332677 nonn,base,easy
%O A332677 0,11
%A A332677 _Giovanni Resta_, Feb 19 2020