|
%I #18 Jul 12 2022 07:46:16
%S 111111111111,1011111111111,1101111111111,1110111111111,1111011111111,
%T 1111101111111,1111110111111,1111111011111,1111111101111,
%U 1111111110111,1111111111011,1111111111101,1111111111110,10011111111111,10101111111111,10110111111111,10111011111111,10111101111111
%N Sums of 12 distinct powers of 10.
%H Robert Israel, <a href="/A038454/b038454.txt">Table of n, a(n) for n = 1..10000</a>
%F a(binomial(N,12)+k) = 10^N + A038453(k) for 1 <= k <= binomial(N,11). - _Robert Israel_, Feb 28 2016
%p N:= 14: # to get all terms of at most N digits
%p sort(map(t -> (10^N-1)/9 - add(10^j, j=t),
%p combinat:-choose([$0..N-1],N-12))); # _Robert Israel_, Feb 28 2016
%t Sort[Plus @@@ Subsets[10^Range[0, 12], {12}]] (* _Amiram Eldar_, Jul 12 2022 *)
%Y Cf. A011557.
%Y Cf. A038444, A038445, A038446, A038447, A038448, A038449, A038450, A038451, A038452, A038453.
%K nonn,easy
%O 1,1
%A _Olivier Gérard_
%E Offset changed to 1 by _Ivan Neretin_, Feb 28 2016
|
