As someone who usually doesn't remember formulas for sums of binomial coefficients (although the sum here is simple to notice given Pascal's triangle), the presence of partial sums in the problem suggests using generating functions.
Note that if we have a function
$$f(x)=c_0+c_1 x+c_2 x^2+...+c_n x^n+... ,$$
then by multiplying by $\frac{1}{1-x}$ we get a new series where the coefficients are the partial sums of the $c_n$'s.
$$\frac{f(x)}{1-x} = f(x) \cdot (1 + x + x^2 + ...) = c_0 + (c_0+c_1)x + ... + \sum_{i=0}^n c_i x^n + ...$$
By using this, we can construct a few functions to find the desired value (careful here, we've changed from 0-indexing to 1-indexing):
\begin{align}
f_1(x) = (1-x)^{-1} &= 1+x+x^2+...\\
f_2(x) = (1-x)^{-2} &= 1+2x+3x^2+...\\
f_3(x) = (1-x)^{-3} &= x_1+x_2 x+x_3x^2+...\\
f_4(x) = (1-x)^{-4} &= y_1+y_2 x+y_3x^2+...\\
f_5(x) = (1-x)^{-5} &= z_1+z_2 x+z_3x^2+...
\end{align}
Note that $\frac{d}{dx} f_n(x) = n f_{n+1}(x)$. In particular, this gives that:
$$x_n = \frac{1}{2} n(n+1)$$
$$y_n = \frac{1}{3} n \cdot x_{n+1} = \frac{1}{6} n(n+1)(n+2)$$
$$z_n = \frac{1}{4} n \cdot y_{n+1} = \frac{1}{24} n(n+1)(n+2)(n+3)$$
from which $z_{20}$ can be easily computed.