A lattice path is a sequence of points in an integer lattice whose consecutive differences belong to a prescribed finite set of steps.
A Dyck path of semilength starts at , ends at , uses steps and , and never passes below the horizontal axis.
The Catalan number
counts Dyck paths of semilength . Its ordinary generating function satisfies .

Articles by others on the same topic (1)

A lattice path is a path in a grid or lattice that consists of a sequence of steps between points in the grid. Typically, a lattice path is defined within a two-dimensional square grid, where the points are represented by pairs of non-negative integers \((x, y)\), and the path is composed of steps that move in specific directions. In the most common cases, the steps are restricted to two directions: right (R) and up (U).