Combinatorial telescoping for an identity of Andrews on parity in partitions

Recently Andrews proposed a problem of finding a combinatorial proof of an identity on the q-little Jacobi polynomials. We give a classification of certain triples of partitions and find bijections based on this classification. By the method of combinatorial telescoping for identities on sums of positive terms, we establish a recurrence relation that leads to the identity of Andrews.