Counting Lattice Paths by Narayana Polynomials

Let d(n) count the lattice paths from (0, 0) to (n, n) using the steps (0,1), (1,0), and (1,1). Let e(n) count the lattice paths from (0, 0) to (n, n) with permitted steps from the step set N

• Type: Journal
• Year: 2000
• Where: COMBINATORICS
• Authors: Robert A. Sulanke
• Keywords: Bijective, COMBINATORICS 2000, Lattice Paths, Step