Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 May 10 2014 13:03:47
%S 45,63,72,81,90,99,108,117,126,135,144,153,162,171,180,189,198,207,
%T 216,225,234,243,252,261,360,405,414,423,432,441,468,477,486,495,504,
%U 522,531,540,549,576,594,603,612,639,648,657,666,675,684,702,711,720,738
%N Numbers that can be written as a sum of numbers using all nonzero decimal digits in descending order.
%C The sequence is divisible by 9 and contains 208 terms. The first term is 45 = 9+8+...+1, the last term is 98765432+1 = 98765433.
%C The decomposition is not unique, for example 126= 98+7+6+5+4+3+2+1 = 9+8+76+5+4+3+21.
%H Michel Lagneau, <a href="/A242263/b242263.txt">Table of n, a(n) for n = 1..208</a>
%e 666 = 9+87+6+543+21.
%p g:= proc(i, j) option remember;
%p `if`(i=j, {10-i}, {parse(cat(seq(10-h, h=i..j))),
%p seq(seq(seq(x+y, y=g(h+1, j)), x=g(i, h)), h=i..j-1)})
%p end:
%p sort([(g(1, 9) minus {987654321})[]])[]; # _Alois P. Heinz_, May 09 2014
%Y Cf. A008591, A242226.
%K nonn,base,fini,full
%O 1,1
%A _Michel Lagneau_, May 09 2014