Combinatorics Enumerative combinatorics: sequences and numbers Concept
Catalan numbers
Summary
The Catalan numbers form a sequence that counts many recursive structures, such as Dyck words, binary trees and bracketings. They satisfy a convolution recurrence and the formula . The node Catalan numbers gives the precise definition.
Where this leads
3 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Catalan_number, lead section
About this page
| Tag | 0YWZJEABB2 |
|---|---|
| URI | m2://0YWZJEABB2 |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05A15 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.