Mathematics
Catalan Numbers and Their Occurrence in Combinatorics
Quick fact
The Catalan numbers appear in over 200 different combinatorial problems—from counting valid bracket arrangements to counting the ways to parenthesize an expression. For example, the 5th Catalan number (42) equals the number of ways to fully parenthesize a sum of 6 numbers, and the 10th Catalan number (16796) counts the number of full binary trees with 11 leaves.
Why this is interesting
You might have noticed that the number of ways to arrange parentheses, triangulate a polygon, or climb a staircase sometimes gives the same surprising sequence. What hidden connection links these seemingly different problems?