SAMS Subject Classification Number: 6

In the early 20th century, P. A. MacMahon proved that the number of partitions of \(n\) wherein no part appears with multiplicity one is equal to the number of partitions of \(n\) where parts are even or congruent to \(3\) modulo \(6\). The first bijective proof of MacMahon’s theorem was provided by G. Andrews, H. Eriksson, F. Petrov and D. Romik. We construct a generalization of their bijection and discuss its consequences.