Schröder number

(mathematics) The number of possible lattice paths from the southwest corner (0, 0) of an n × n grid to the northeast corner (n, n), using only single steps north, northeast or east, and not rising above the southwest–northeast diagonal.