arXiv (All)
open access
The two-block odd partition function
We investigate arithmetic and combinatorial properties of the function $a(n)$, which is the signed number of partitions of $n$ into exactly two distinct part sizes, each occurring an odd number of times. We prove that $a(n)\ge 0$ for all $n$, establishing a positivity phenomenon for a signed partiti
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the sum of odd minimal excludants over overpartitions#1116538
- A Note On Certain Minimal Excludants Over Overpartitions#1036044
- Signed Sets with Few Subset Sums at the Offset-Two and Next Boundaries: Complete All-Size Classifications#1090119
- A new proof that more than $2/3$ of the zeros of the Riemann zeta function are simple and on the critical line#986353
- Statistical theory of integer partitions#956550
Record · ID 1118843
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive