Combinatorial telescoping for an identity of Andrews on parity in partitions

► We present a general framework of combinatorial telescoping for sums of positive terms. ► We give a classification of certain triples of partitions and find bijections and involutions based on this classification. ► By the method of combinatorial telescoping, we obtain a recurrence relation leading to an identity of Andrews.