An analogue of Eulerʹs identity and new combinatorial properties of n-colour compositions

An analogue of Eulerʹs partition identity: “The number of partitions of a positive integer ν into odd parts equals the number of its partitions into distinct parts” is obtained for ordered partitions. The ideas developed are then used in obtaining several new combinatorial properties of the n-colour compositions introduced recently by the author.