Catalan numbers revisited (Q5906602)

This paper gives another proof for the well-known fact, that the number of the well-formed orderings of \(n\) open and \(n\) closed parentheses is \({2n\choose n}/(n+1)\). The presented method works partitioning all the possible \({2n\choose n}\) orderings into classes of size \((n+1)\) such that every and each class contains exactly one well-formed parenthesizing.