A correspondence between ordered trees a
β
Helmut Prodinger
π
Article
π
1983
π
Elsevier Science
π
English
β 54 KB
The Narayana numbers n appear twice in Volume 31 of Discrete Mathematics: They count the ordere0 trees with n edges (i.e. n+l nodes) and k leaves [1] and the noncrossing partitions of {1 ..... n} into k blocks . (In such a partition the existence of four numbers a<b<c<d such that a and c are in one