Math 2.0

Combinatorics Enumerative combinatorics: sequences and numbers Concept

Motzkin number

Summary

The Motzkin number MnM_n counts certain lattice paths from (0,0)(0, 0) to (n,0)(n, 0), 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 nn points on a circle. The sequence starts 1,1,2,4,9,21,51,1271, 1, 2, 4, 9, 21, 51, 127. The Motzkin numbers are a close relative of the Catalan numbers, which count the same paths without flat steps.

Further reading

  1. Web https://en.wikipedia.org/wiki/Motzkin_number
About this page
TagPB0DSH9XCG
URIm2://PB0DSH9XCG
Kindconcept
WritingW0 stub
MSC05A15, 11B83
Same as
Changed2 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.

What links here

Definitions