A combinatorial interpretation of the connection constants for persistent sequences of polynomials

We give a combinatorial interpretation of the connection constants for persistent sequences of polynomials in terms of weighted binary paths. In this way we give bijective proofs for many formulas which generalize several classical identities and recurrences, such as the upper index sum, the Lagrange and the Vandermonde sum and Euler’s theorem on the coefficients of Gaussian coefficients.