|
|
A091890
|
|
Number of partitions of n into sums of exactly three distinct powers of 2.
|
|
5
|
|
|
0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 2, 0, 0, 0, 1, 1, 1, 3, 2, 0, 1, 3, 3, 2, 5, 2, 1, 1, 5, 6, 3, 9, 5, 4, 5, 10, 9, 8, 13, 8, 10, 8, 16, 17, 15, 22, 18, 18, 20, 25, 28, 27, 34, 31, 32, 33, 44, 49, 44, 64, 53, 56, 61, 71, 77, 77, 100, 88, 94, 99, 123, 125, 132, 162, 147, 154
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,14
|
|
LINKS
|
|
|
EXAMPLE
|
a(14)=2: 14 = (2^3+2^2+2^1) = (2^2+2^1+2^0)+(2^2+2^1+2^0).
|
|
MATHEMATICA
|
With[{max = 80}, m = Select[Range[max], DigitCount[#, 2, 1] == 3 &]; a[n_] := Length@ IntegerPartitions[n, n, m]; Array[a, max]] (* Amiram Eldar, Aug 01 2023 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|