Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
