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 A179955 #17 Oct 17 2016 10:30:53
%S A179955 19,28,37,46,55,64,73,82,91,118,127,136,145,154,163,172,181,217,226,
%T A179955 235,244,253,262,271,316,325,334,343,352,361,415,424,433,442,451,514,
%U A179955 523,532,541,613,622,631,712,721,811,1117,1126,1135,1144,1153,1162,1171
%N A179955 Numbers whose sum of digits is 10 and which contain no 0 digits.
%C A179955 Subset of A052224.
%C A179955 Finite sequence. Highest member is 1111111111.
%C A179955 Contribution from _Zak Seidov_, Aug 06 2010, as corrected by _D. S. McNeil_: There are exactly 511 terms.
%H A179955 Alois P. Heinz, <a href="/A179955/b179955.txt">Table of n, a(n) for n = 1..511</a>
%e A179955 19 is an element of the list because 1+9 = 10.
%e A179955 109 is not an element because it contains a 0.
%p A179955 with(combinat):
%p A179955 sort(select(y->y<>10, map(x->parse(cat(x[])), map(p->permute(p)[], partition(10)))))[]; # _Alois P. Heinz_, Sep 24 2013
%t A179955 Reap[For[n=1; k=1, n <= 2*10^9, n++, id = IntegerDigits[n]; If[Total[id] == 10 && FreeQ[id, 0], Print["a(", k, ") = ", n]; Sow[n]; k++]]][[2, 1]] (* _Jean-François Alcover_, Jan 08 2016 *)
%t A179955 sd10Q[n_]:=Module[{idn=IntegerDigits[n]},FreeQ[idn,0]&&Total[idn]==10]; Select[Range[1200],sd10Q] (* _Harvey P. Dale_, Oct 17 2016 *)
%Y A179955 Cf. A007953, A017173, A052224.
%K A179955 base,easy,fini,full,nonn
%O A179955 1,1
%A A179955 _Dominick Cancilla_, Aug 03 2010