Combinatorics Enumerative combinatorics: sequences and numbers Concept
Motzkin number
Summary
The Motzkin number counts certain lattice paths from to , see the definition. The paths use up, down and flat steps and never go below the horizontal axis. It also counts the ways to draw non-crossing chords between points on a circle. The sequence starts . The Motzkin numbers are a close relative of the Catalan numbers, which count the same paths without flat steps.
Further reading
About this page
| Tag | PB0DSH9XCG |
|---|---|
| URI | m2://PB0DSH9XCG |
| Kind | concept |
| Writing | W0 stub |
| MSC | 05A15, 11B83 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.