In combinatorics, the Narayana numbers form a triangular array of natural numbers, called the Narayana triangle, that occur in various counting problems. They are named after Canadian mathematician T. V. Narayana (1930–1987). Formula The Narayana numbers can be expressed in terms of binomial coefficients: Numerical values The first eight rows of the Narayana triangle read: Combinatorial interpretations Dyck words An example of a counting problem whose solution can be given in terms of the Narayana numbers , is the number of words containing pairs of parentheses, which are correctly matched (known as Dyck words) and which contain distinct nestings. For instance, , since with four pairs of parentheses, six sequences can be created which each contain two occurrences the sub-pattern : (()(())) ((()())) ((())()) ()((())) (())(()) ((()))() From this example it should be obvious that , since the only way to get a single sub-pattern is to have all the opening parentheses in the first positions, followed by all the closing parentheses. Also , as distinct nestings can be achieved only by the repetitive pattern . More generally, it can be shown that the Narayana triangle is symmetric: The sum of the rows in this triangle equal the Catalan numbers: Monotonic lattice paths The Narayana numbers also count the number of lattice paths from to , with steps only northeast and southeast, not straying below the -axis, with peaks. The following figures represent the Narayana numbers , illustrating the above mentioned symmetries. The sum of is 1 + 6 + 6 + 1 = 14, which is the 4th Catalan number, . This sum coincides with the interpretation of Catalan numbers as the number of monotonic paths along the edges of an grid that do not pass above the diagonal. Rooted trees The number of unlabeled ordered rooted trees with edges and leaves is equal to . This is analogous to the above examples: Each Dyck word can be represented as a rooted tree. We start with a single node – the root node. This is initially the active node. Reading the word from left to right, when the symbol is an opening parenthesis, add a child to the active a node and set this child as the active node. When the symbol is a closing parenthesis, set the parent of the active node as the active node. This way we obtain a tree, in which every non-root node corresponds