sum of solutions of $\{(x,y,z)\mid x+y+z=k\}$, $k = 1,\ldots,N$ What is the sum of non-negative integer solutions of $\{(x,y,z)\mid x+y+z=k\}$, $k = 1,\ldots,N$? 
I know that $\{(x,y,z)\mid x+y+z=k\}$ has $\binom{k+3-1}{3-1}=\binom{k+2}{2}$ non-negative integer solutions. Thus, the answer to the question above is $$\sum_{k=1}^N \binom{k+2}{2}.$$
Can we further simplify the summation?

The set of solutions of the set of equations 
$$x + y + z = k  \qquad 1 \leq k \leq N \tag{1}$$
in the non-negative integers is the set of solutions of the inequality
$$x + y + z \leq N \tag{2}$$
in the non-negative integers with the exception of $(0, 0, 0)$.  The number of solutions of the inequality in the non-negative integers is the number of solutions of the equation
$$w + x + y + z = N \tag{3}$$
where $w = N - x - y - z$.  The number of solutions of equation 3 in the non-negative integers is equal to the number of ways three addition signs can be placed in a row of $N$ ones, which is 
$$\binom{N + 3}{3}$$
since we must select which $3$ of the $N + 3$ symbols (three addition signs and $N$ ones) will be addition signs.  Hence, the number of solutions of the set of equations $x + y + z = k$ if $1 \leq k \leq N$ in the non-negative integers is 
$$\binom{N + 3}{3} - 1$$
whence
$$\sum_{k = 1}^{N} \binom{k + 2}{2} = \binom{N + 3}{3} - 1$$ 
