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

Popular posts from this blog

Add email recipient to all new Trac tickets -

400 Bad Request on Apache/PHP AddHandler wrapper -

php - Change action and image src url's with jQuery -