In combinatorial mathematics, Catalan's triangle is a number triangle whose entries C ( n , k ) {\displaystyle C(n,k)} give the number of strings consisting of n X's and k Y's such that no initial segment of the string has more Y's than X's. It is a generalization of the Catalan numbers, and is named after Eugène Charles Catalan.
In combinatorial mathematics, Catalan's triangle is a number triangle whose entries C ( n , k ) {\displaystyle C(n,k)} give the number of strings consisting of n X's and k Y's such that no initial segment of the string has more Y's than X's. It is a generalization of the Catalan numbers, and is named after Eugène Charles Catalan.
Source: Wikipedia "Catalan's triangle" · CC BY-SA 4.0
Share this article: X · Bluesky