← BackMark CompleteCatalan NumbersSequence counting recursive structures (parentheses, BSTs).mathcombinatoricsUpdated 2025-09-01FormulaC_n = (1/(n+1)) * binom(2n,n)RecurrenceC_{n+1} = Σ C_i * C_{n-i}