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 A302556 #7 Aug 18 2018 11:27:35
%S A302556 0,1,11,3,13,5,15,7,17,9,19,119,39,139,59,159,79,179,99,199,1199,399,
%T A302556 1399,599,1599,799,1799,999,1999,11999,3999,13999,5999,15999,7999,
%U A302556 17999,9999,19999,119999,39999,139999,59999,159999,79999,179999,99999,199999,1199999,399999
%N A302556 Expansion of x*(1 + 2*x*(5 - 4*x)*(1 + x^2)*(1 + x^4))/((1 - x)*(1 - 10*x^9)).
%C A302556 a(n) is the smallest number whose sum of odd decimal digits is n.
%H A302556 <a href="/index/Di#digital">Index entries for sequences related to digital root, sum, etc.</a>
%H A302556 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,0,0,10,-10).
%F A302556 G.f.: x*(1 + 2*x*(5 - 4*x)*(1 + x^2)*(1 + x^4))/((1 - x)*(1 - 10*x^9)).
%F A302556 a(n) = a(n-1) + 10*a(n-9) - 10*a(n-10).
%t A302556 CoefficientList[Series[x (1 + 2 x (5 - 4 x) (1 + x^2) (1 + x^4))/((1 - x) (1 - 10 x^9)), {x, 0, 48}], x]
%t A302556 LinearRecurrence[{1, 0, 0, 0, 0, 0, 0, 0, 10, -10}, {0, 1, 11, 3, 13, 5, 15, 7, 17, 9}, 49]
%Y A302556 Cf. A051885, A071649.
%K A302556 nonn,base,easy
%O A302556 0,3
%A A302556 _Ilya Gutkovskiy_, Aug 15 2018