A242267 - OEIS

%I #18 Aug 31 2021 02:42:53

%S 45,54,63,72,81,90,99,108,117,126,135,144,153,162,171,180,189,198,207,

%T 216,225,234,243,252,261,270,288,297,306,315,324,333,342,351,360,369,

%U 378,387,396,405,414,423,432,441,468,477,486,495,504,522,531,540,549

%N Numbers that can be written as a sum of numbers using all decimal digits in descending order.

%C The sequence is divisible by 9 and contains 368 terms. The first term is 45 = 9 + 8 + ... + 1 + 0; the last two terms are 876543219 = 9 + 876543210 and 987654321 = 987654321 + 0.

%C The decomposition is not unique.

%H Michel Lagneau, <a href="/A242267/b242267.txt">Table of n, a(n) for n = 1..368</a>

%e 540 is in the sequence because 540 = 9 + 8 + 76 + 5 + 432 + 10.

%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, 10) minus {9876543210})[]])[]; # program after _Alois P. Heinz_, May 09 2014, adapted for this sequence. See A242263.

%Y Cf. A242263.

%K nonn,base,fini,full

%O 1,1

%A _Michel Lagneau_, May 10 2014