C_n = C(2n,n) / (n+1). Counts balanced-parenthesis strings, binary trees of n internal nodes, non-crossing partitions, and much more.
C_n = C(2n,n) / (n+1). Counts balanced-parenthesis strings, binary trees of n internal nodes, non-crossing partitions, and much more.