Answers are grounded in this paper and cite their sources.
It is proved that the number of partitions of n with odd mex and k parts that aren’t ones equals the number of partitions of n with nonnegative crank and k parts that aren’t ones.
No takes yet. Share an insight, caveat, or question.
Andrews et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: