A Refinement of the Crank-Mex Theorem
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..
math.CO↗
arXiv subjects
Publications and source records attributed to Moshe Newman.
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..