cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A271364 Number of novel integer partitions whose parts sum to 2n.

Original entry on oeis.org

1, 1, 2, 4, 8, 15, 29, 52, 93, 162, 279, 463, 769, 1236, 1975, 3100, 4824, 7358, 11200, 16706
Offset: 1

Views

Author

Nathan Fox, Apr 05 2016

Keywords

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.

Examples

			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

Cf. A270638.
Showing 1-1 of 1 results.