\(n\)-colour compositions (Q5928323)

Due to MacMahon an ordered partition (or a composition) of an integer is a partition where the order of the parts counts: the ordered partitions 1-2-1 and 1-1-2 are different. An \(n\)-colour partition is a partition where a part of size \(n\) may have \(n\) different colours. This paper studies \(n\)-colour compositions which are defined accordingly. The paper develops generating functions for \(n\)-colour compositions and for \(n\)-colour compositions into a given number of parts.