MacMahon's partition identity and the coin exchange problem

One of MacMahon's partition theorems says that the number of partitions of n into parts divisible by 2 or 3 equals the number of partitions of n into parts with multiplicity larger than 1. Recently, Holroyd has obtained a generalization. In this short note, we provide a bijective proof of his theorem.