MathCastle
Counting & ProbabilitySuperchallengeRecursion, Catalan Numbers & Generating Functions

Recursion, Catalan Numbers & Generating Functions · Superchallenge problem

A sequence of 1414 terms, each equal to +1+1 or −1-1, contains seven +1+1's and seven −1-1's. How many such sequences have every partial sum (the sum of the first kk terms, for k=1,2,…,14k=1,2,\dots,14) between 00 and 33 inclusive?