|
| |
|
|
A038454
|
|
Sums of 12 distinct powers of 10.
|
|
10
|
|
|
|
111111111111, 1011111111111, 1101111111111, 1110111111111, 1111011111111, 1111101111111, 1111110111111, 1111111011111, 1111111101111, 1111111110111, 1111111111011, 1111111111101, 1111111111110, 10011111111111, 10101111111111, 10110111111111, 10111011111111, 10111101111111
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Robert Israel, Table of n, a(n) for n = 1..10000
|
|
|
FORMULA
|
a(binomial(N,12)+k) = 10^N + A038453(k) for 1 <= k <= binomial(N,11). - Robert Israel, Feb 28 2016
|
|
|
MAPLE
|
N:= 14: # to get all terms of at most N digits
sort(map(t -> (10^N-1)/9 - add(10^j, j=t),
combinat:-choose([$0..N-1], N-12))); # Robert Israel, Feb 28 2016
|
|
|
MATHEMATICA
|
Sort[Plus @@@ Subsets[10^Range[0, 12], {12}]] (* Amiram Eldar, Jul 12 2022 *)
|
|
|
CROSSREFS
|
Cf. A011557.
Cf. A038444, A038445, A038446, A038447, A038448, A038449, A038450, A038451, A038452, A038453.
Sequence in context: A233495 A233616 A095427 * A288275 A287233 A122717
Adjacent sequences: A038451 A038452 A038453 * A038455 A038456 A038457
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
Olivier Gérard
|
|
|
EXTENSIONS
|
Offset changed to 1 by Ivan Neretin, Feb 28 2016
|
|
|
STATUS
|
approved
|
| |
|
|
