MathNet 2011 Question 31

Find the number of sequences consisting of $100$ $R$'s and $2011$ $S$'s that satisfy the property that among the first $k$ letters, the number of $S$'s is strictly more than $20$ times the number of $R$'s for all $1 \leq k \leq 2111$.