The Delannoy numbers are the number of lattice paths from to in which only east (1, 0), north (0, 1), and northeast (1, 1) steps are allowed (i.e., , , and ). They are given by the recurrence relation

with . The are also given by the sums

			(2)
			(3)
			(4)

where is a hypergeometric function.

A table for values for the Delannoy numbers is given by

(Sloane's A008288 ).

They have the generating function

(Comtet 1974, p. 81).

Taking gives the central Delannoy numbers , which are the number of "king walks" from the corner of an square to the upper right corner . These are given by

where is a Legendre polynomial (Moser 1955; Comtet 1974, p. 81; Vardi 1991). Another expression is

			(8)
			(9)

where is a binomial coefficient and is a hypergeometric function. These numbers have a surprising connection with the Cantor set (E. W. Weisstein, Apr. 9, 2006).

They also satisfy the recurrence equation

They have generating function

			(11)
			(12)

The values of for , 2, ... are 3, 13, 63, 321, 1683, 8989, 48639, ... (Sloane's A001850). The numbers of decimal digits in for , 1, ... are 1, 7, 76, 764, 7654, 76553, 765549, 7655510, ... (Sloane's A114470), where the digits approach those of (Sloane's A114491).

The first few prime Delannoy numbers are 3, 13, 265729, ... (Sloane's A092830), corresponding to indices 1, 2, 8, ..., with no others for (Weisstein, Mar. 8, 2004).

The Schröder numbers bear the same relation to the Delannoy numbers as the Catalan numbers do to the binomial coefficients.

Amazingly, taking the Cholesky decomposition of the square array of , transposing, and multiplying it by the diagonal matrix gives the square matrix (i.e., lower triangular) version of Pascal's triangle (G. Helms, pers. comm., Aug. 29, 2005).

Beautiful fractal patterns can be obtained by plotting (mod ) (E. Pegg, Jr., pers. comm., Aug. 29, 2005). In particular, the case corresponds to a pattern resembling the Sierpiński carpet.