| M. Aigner, "Motzkin numbers", Europ. J. Combinatorics 19, 1998, 663 -- 675. |
.... as in [90] The Motzkin numbers were first introduced by Motzkin in [74] in the analysis of an enumeration problem concerning the number of di#erent triangulations of an n gon, they arise as the enumeration function for another kind of trees [68] and have many further applications see [34] [8] and [94] pp. 238 239 . The sequence (M n ) # n=0 starts with 1, 1, 2, 4, 9, 21, 51, Here a closed expression as for the Catalan numbers is not known, however in [34] it was also derived that the numbers M n can be obtained as the entries b (2) n, 0) of the Pascal like triangle ....
M. Aigner, "Motzkin numbers", Europ. J. Combinatorics 19, 1998, 663 -- 675.
No context found.
M. Aigner, "Motzkin numbers", Europ. J. Combinatorics 19, 1998, 663 -- 675.
No context found.
M. Aigner, Motzkin numbers, Europ. J. Combin., 19 (1998), 663--675.
No context found.
M. Aigner, Motzkin numbers, Europ. J. Combin., 19 (1998), 663-675.
No context found.
M. Aigner, Motzkin numbers. European J. Combin. 19 (1998), 663-675.
No context found.
M. Aigner, "Motzkin numbers", Europ. J. Combinatorics 19, 1998, 663 -- 675.
No context found.
M. Aigner, \Motzkin numbers", Europ. J. Combinatorics 19, 1998, 663 - 675.
No context found.
M. Aigner, "Motzkin numbers", Europ. J. Combinatorics 19, 1998, 663 -- 675.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC