Objects Counted by Central Delannoy Numbers
| dc.contributor.advisor | Getu, Seyoum (PhD) | |
| dc.contributor.author | Getachew, Frether | |
| dc.date.accessioned | 2018-07-13T07:34:04Z | |
| dc.date.accessioned | 2023-11-04T12:31:38Z | |
| dc.date.available | 2018-07-13T07:34:04Z | |
| dc.date.available | 2023-11-04T12:31:38Z | |
| dc.date.issued | 2013-02 | |
| dc.description.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". | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/8506 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | Objects Counted By Central | en_US |
| dc.title | Objects Counted by Central Delannoy Numbers | en_US |
| dc.type | Thesis | en_US |