cp's OEIS Frontend

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.

A179955 Numbers whose sum of digits is 10 and which contain no 0 digits.

Original entry on oeis.org

19, 28, 37, 46, 55, 64, 73, 82, 91, 118, 127, 136, 145, 154, 163, 172, 181, 217, 226, 235, 244, 253, 262, 271, 316, 325, 334, 343, 352, 361, 415, 424, 433, 442, 451, 514, 523, 532, 541, 613, 622, 631, 712, 721, 811, 1117, 1126, 1135, 1144, 1153, 1162, 1171
Offset: 1

Views

Author

Dominick Cancilla, Aug 03 2010

Keywords

Comments

Subset of A052224.
Finite sequence. Highest member is 1111111111.
Contribution from Zak Seidov, Aug 06 2010, as corrected by D. S. McNeil: There are exactly 511 terms.

Examples

			19 is an element of the list because 1+9 = 10.
109 is not an element because it contains a 0.
		

Crossrefs

Programs

  • Maple
    with(combinat):
    sort(select(y->y<>10, map(x->parse(cat(x[])), map(p->permute(p)[], partition(10)))))[]; # Alois P. Heinz, Sep 24 2013
  • Mathematica
    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 *)
    sd10Q[n_]:=Module[{idn=IntegerDigits[n]},FreeQ[idn,0]&&Total[idn]==10]; Select[Range[1200],sd10Q] (* Harvey P. Dale, Oct 17 2016 *)