|
| |
|
|
A271364
|
|
Number of novel integer partitions whose parts sum to 2n.
|
|
0
|
|
|
|
1, 1, 2, 4, 8, 15, 29, 52, 93, 162, 279, 463, 769, 1236, 1975, 3100, 4824, 7358, 11200, 16706
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,3
|
|
|
COMMENTS
|
A novel integer partition is an integer partition with k parts with overall gcd 1 such that there are k-1 linearly independent ways to add up the parts with plus or minus signs and reach zero.
For a novel integer partition, it is always possible to add up the parts with plus or minus signs and reach zero. For this reason, no odd number can be the sum of a novel partition.
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
111111 and 21111 are both novel partitions, and they both sum to 6. No other novel partition sums to 6, so, a(3)=2.
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,more
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
