math - Looking for a combinatorial problem definition -
we given "n" pairs of parentheses, ie "n" opening parenthesis "(" , "n" closing parenthesis ")". asked find number of ways make sequence of 2n parentheses that good, i.e. dont close before opening.
i need find definition good sequences can use rest of problem.
catalan numbers!
Comments
Post a Comment