arXiv (All)
open access
The range and omitted values of a certain sequence involving the partition function
Let \(p(n)\) denote the ordinary partition function. Motivated by analogous questions concerning Euler's totient function and its complementary counting function, we study the range of the partition-derived sequence \(p(n)-n\). We give combinatorial interpretations of this sequence and investigate b
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
- Lower Bounds for Subset Sum in Resolution with Modular Counting#158594
- On the sum of odd minimal excludants over overpartitions#1116538
- On a problem on Ramanujan-Sato series of level 11#1155486
- A proof of the Baruah--Gogoi conjecture on sums of odd and even overlined parts#1063561
- Signed Sets with Few Subset Sums at the Offset-Two and Next Boundaries: Complete All-Size Classifications#1090119
Record · ID 986452
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