
doi: 10.37236/1858
In this paper, we examine partitions $\pi$ classified according to the number $r(\pi)$ of odd parts in $\pi$ and $s(\pi)$ the number of odd parts in $\pi\prime$, the conjugate of $\pi$. The generating function for such partitions is obtained when the parts of $\pi$ are all $\leq N$. From this a variety of corollaries follow including a Ramanujan type congruence for Stanley's partition function $t(n)$.
partition identities, Combinatorial aspects of partitions of integers, generating function, Exact enumeration problems, generating functions, Elementary theory of partitions, Combinatorial identities, bijective combinatorics
partition identities, Combinatorial aspects of partitions of integers, generating function, Exact enumeration problems, generating functions, Elementary theory of partitions, Combinatorial identities, bijective combinatorics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 14 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
