This question is related to Stars and Bars with bounds
I have what I thought is a fairly simple problem: Count non-negative integer solutions to the equation
$$x_1 + x_2 + x_3 + x_4 + x_5 = 23$$
such that $0 \leq x_1 \leq 9$.
The accepted answer uses nCr such that order does not matter. But if order does matter can the function be replaced from \begin{align*} [x^j](1+x)^n=\binom{n}{j} \end{align*} to then be
\begin{align*} [x^j](1+x)^n=n^j \end{align*}