In this paper, by using Riordan arrays and a particular model of lattice paths, we are able to generalize in several ways an identity proposed by Lou Shapiro by giving both an algebraic and a combinatorial proof. The identities studied in this paper allow us to move from an arithmetic progression, and other C-finite sequences, to a geometric progression in terms of Riordan array transformations and vice versa, via the Riordan array inverse.