The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A179955 Numbers whose sum of digits is 10 and which contain no 0 digits. 2

%I

%S 19,28,37,46,55,64,73,82,91,118,127,136,145,154,163,172,181,217,226,

%T 235,244,253,262,271,316,325,334,343,352,361,415,424,433,442,451,514,

%U 523,532,541,613,622,631,712,721,811,1117,1126,1135,1144,1153,1162,1171

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

%C Subset of A052224.

%C Finite sequence. Highest member is 1111111111.

%C Contribution from _Zak Seidov_, Aug 06 2010, as corrected by _D. S. McNeil_: There are exactly 511 terms.

%H Alois P. Heinz, <a href="/A179955/b179955.txt">Table of n, a(n) for n = 1..511</a>

%e 19 is an element of the list because 1+9 = 10.

%e 109 is not an element because it contains a 0.

%p with(combinat):

%p sort(select(y->y<>10, map(x->parse(cat(x[])), map(p->permute(p)[], partition(10)))))[]; # _Alois P. Heinz_, Sep 24 2013

%t 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 sd10Q[n_]:=Module[{idn=IntegerDigits[n]},FreeQ[idn,0]&&Total[idn]==10]; Select[Range[1200],sd10Q] (* _Harvey P. Dale_, Oct 17 2016 *)

%Y Cf. A007953, A017173, A052224.

%K base,easy,fini,full,nonn

%O 1,1

%A _Dominick Cancilla_, Aug 03 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 24 21:50 EDT 2021. Contains 345433 sequences. (Running on oeis4.)