I know that $$\binom{n}{k} = \binom{n}{n-k}$$
My question is does there exist a similar identity where you change the top of the choose function, o any similar to the identity above?
An example: Can you define $m$ in terms of $n$ and $k$ such that $$\binom{n}{k}=\binom{n+m}{k}$$
It is standard to define $$ \binom{-n}{k}=(-1)^k\binom{n+k-1}{k} $$ as, e.g., here. (Whether or not this needs to be a separate definition depends on how you defined the binomial coefficient in the first place, but it's pretty much always going to be the right choice.)