Objects Counted by Central Delannoy Numbers
No Thumbnail Available
Date
2013-02
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Addis Ababa University
Abstract
This work deals with Central Delannoy numbers, enumerated as Dn;n = (Dn)n_0
= 1, 3, 13, 63, 321, 1683, 8989, 48639, . . ., which counts the number of lattice
paths running from (0; 0) to (n; n) by using the steps (1; 0), (0; 1) and (1; 1). We
will see some collection of examples that these numbers count. Also we will try to
solve a problem on the Delannoy numbers, that is, proving that the central Delannoy
numbers also exist on the diagonal, in the rectangular format of another array of
numbers, namely Sulanke numbe".
Description
Keywords
Objects Counted By Central