Bell polynomials and k-generalized Dyck paths

Aigner, 1998, Motzkin numbers, Eur. J. Combin., 19, 663, 10.1006/eujc.1998.0235 Bell, 1927, Partition polynomials, Ann. Math., 29, 38, 10.2307/1967979 Bernhart, 1999, Catalan, Motzkin and Riordan numbers, Discrete Math., 204, 73, 10.1016/S0012-365X(99)00054-0 Chen, 1999, A general bijective algorithm for increasing trees, Systems Sci. Math. Sci., 12, 193 L. Comtet, Advanced Combinatorics, Presses Universitaires de France Io8, Boulevard Saint-Germain, Paris, 1970 Corsani, 1998, Left-inversion of combinatorial sums, Discrete Math., 180, 107, 10.1016/S0012-365X(97)00110-6 Goulden, 1983 Klarner, 1970, Correspondences between plane trees and binary sequences, J. Combin. Theory, Ser. A., 9, 401, 10.1016/S0021-9800(70)80093-X T. Mansour, Y. Sun, Dyck paths and partial Bell polynomials (submitted for publication) Wilf, 1990