combinatorics – Looking for formula for variation of binomial theorem

Is there variation of the binomial theorem as follows?

$$sum_{i=0}^n {m choose i} a^{n-i} b^i $$

I am trying to find a formula for it that is a function of $n$ without summation notation. I think you would call this is a solution in closed form. Any help would be great. Thanks.