In combinatorics, a lattice path L in the d-dimensional integer lattice of length k with steps in the set S, is a sequence of vectors such that each consecutive difference lies in S. A lattice path may lie in any lattice in , but the integer lattice is most commonly used. An example of a lattice path in of length 5 with steps in is .