1 reference results for: Delannoy number
Wikipedia
In mathematics, a Delannoy number describes the number of paths from the southwest corner (0, 0) of a rectangular grid to the northeast corner (a, b), using only single steps north, northeast, or east.
For an n × n grid, the first few Delannoy numbers (starting with n=0) are :
1, 3, 13, 63, 321, 1683, 8989, 48639, 265729, ...
The following figure illustrates the 63 Delannoy paths through a 3 × 3 grid:
The paths that do not rise above the SW-NE diagonal represent the Schröder numbers.
See also
References
Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)
This article is licensed under the GNU Free Documentation License.
Last updated on Wednesday February 06, 2008 at 05:17:46 PST (GMT -0800)
View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation
This article is licensed under the GNU Free Documentation License.
Last updated on Wednesday February 06, 2008 at 05:17:46 PST (GMT -0800)
View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation
Copyright © 2008, Dictionary.com, LLC. All rights reserved.











