MathCastle
Counting & ProbabilitySuperchallengeRecursion, Catalan Numbers & Generating Functions

Recursion, Catalan Numbers & Generating Functions · Superchallenge problem

Let C(x)=∑n≥0CnxnC(x)=\sum_{n\ge 0}C_nx^n satisfy C(x)=1+xC(x)2C(x)=1+xC(x)^2. Solve for C(x)C(x), then use the binomial series to recover Cn=1n+1(2nn)C_n=\frac{1}{n+1}\binom{2n}{n}; state the value of C5C_5.