Sum of combinations with varying $n$ [duplicate]

combinatorics summation

Yes your formula is corrct and: $$\sum_{n=1}^m \dbinom{n+r}n=\sum_{n=1}^m\dbinom{n+r}{r}$$

and you can prove by induction that this $\dbinom{m+r+1}{r+1}-1$

Related

Generalized Owen's T function
double check my steps to find multiplicative inverse?
Is $\frac{x^2+x}{x+1}$ a polynomial?
Entire function bounded by polynomial of degree 3/2 must be linear.
Find the power series of $f(x)=\frac{1}{x^2+x+1}$
Mathematical induction problem: $\frac12\cdot \frac34\cdots\frac{2n-1}{2n}<\frac1{\sqrt{2n}}$
Prove that if $A$ is an infinite set then $A \times 2$ is equipotent to $A$
Trig integral $\int ( \cos{x} + \sin{x}\cos{x}) \, dx $
Inverse of $y=xe^x$
Currently, what is the largest publicly known prime number such that all prime numbers less than it are known?
Which step in this process allows me to erroneously conclude that $i = 1$
Smallest integer which leaves remainder 3, 2, 1 when divided by 17, 15, 13