$C_n$(the $n^{th}$ catalan number) counts the number of expressions containing $n$ pairs of parenthesis which are correctly matched How to count the possibilities if the maximum nesting level is fixed to $d$?
Total no. of balanced parenthesis with maximum nesting of $d$
2
$\begingroup$
combinatorics
sequences-and-series