Arrangements and Combinations · Catalan Numbers: Introduction

Lesson 9

Nikolai Chukhin · Alexander S. Kulikov

Problem. Let \(C(n)\) denote the number of valid parentheses sequences with \(n\) opening and \(n\) closing parentheses. For example, \(C(3)=5\): \[\texttt{()()() ()(()) (())() (()()) ((()))}\ .\] What is \(C(7)\)?

1 point