On generalizations of theorems of MacMahon and Subbarao (Q6170066)

\textit{P. A. MacMahon} [Combinatory analysis. Vol. 2. Cambridge: University Press (1916; JFM 46.0118.07)] proved that the number of partitions of \(n\) in which odd multiplicities are greater than \(1\) is equal to the number of partitions of \(n\) in which odd parts are congruent to \(3\pmod 6\). This result was generalised by \textit{G. E. Andrews} [J. Comb. Theory 3, 100--101 (1967; Zbl 0156.02802)] as follows: the number of partitions of \(n\) in which odd multiplicities are greater than or equal to \(2r+1\) is equal to the number of partitions of \(n\) in which odd parts are congruent to \(2r + 1 \pmod {4r + 2}\). In this paper the authors provide a new bijective proof for these results. In addition, the authors consider Subbarao's finitization of Andrews' extension and generalize this result of \textit{M. V. Subbarao} [Proc. Am. Math. Soc. 27, 449--450 (1971; Zbl 0219.10022)].