a Center for Combinatorics, LPMC and TJKLC, Nankai University, Tianjin 300071, PR China b Department of Applied Mathematics, Dalian University of Technology, Dalian, Liaoning 116024, PR China
Abstract:
Riordan paths are Motzkin paths without horizontal steps on the x-axis. We establish a correspondence between Riordan paths and -avoiding derangements. We also present a combinatorial proof of a recurrence relation for the Riordan numbers in the spirit of the Foata-Zeilberger proof of a recurrence relation on the Schröder numbers.