Abstract
We generalize the method of combinatorial telescoping to the case of multiple summations. We shall demonstrate this idea by giving combinatorial proofs for two identities of Andrews on parity indices of partitions.
All Related Versions

This publication has 5 references indexed in Scilit: