arXiv (All)
open access
Congruences for the Andrews--Uncu partition function $\mathcal{EO}_u(n)$
In 2018, Andrews defined and studied the partition function $\mathcal{EO}(n)$, which counts the number of partitions of $n$ where each even part is less than each odd part. Thereafter, Uncu considered a different subset of such partitions, namely those partitions counted by $\mathcal{EO}(n)$ where t
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 Divisibility Relation $σ(n)\midσ(n+h)$ and a Generalized Erdős--Sierpiński Conjecture#971941
- Little Red Dots: An abundant population of faint active galactic nuclei at z ∼ 5 revealed by the EIGER and FRESCO JWST surveys#364262
- Some remarks and results on the so-called Standard (2, 2)-Conjecture#8230
- Congruence Classes of Supporting the Erdös-Straus Conjecture I: Tame Solutions#1048327
- Low-energy collective structure of $^{92,94}$Zr and $^{94}$Mo from ($e,e^{\prime}$) and ($p,p^{\prime}$) scattering II. Signatures of mixed-symmetry states and origin of collectivity#1083406
Record · ID 1142225
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