1
$\begingroup$

..I wonder if the following formula can be calculated?

$ \sum_{k=0}^m {m \choose k} {2k \choose n} $

$\endgroup$
2
  • 1
    $\begingroup$ Look at the FAQ - even if such a thing can be calculated why do we care and what is your motivation? In particular, have you looked at various methods that are already available (combinatorial methods, generating functions etc.) and see if they work? $\endgroup$ Oct 23, 2011 at 5:12
  • 1
    $\begingroup$ I am pretty sure this is a hw question as I could do it in 5 minutes. $\endgroup$
    – John Jiang
    Oct 23, 2011 at 6:02

1 Answer 1

1
$\begingroup$

The generating function in $n$ is $((1+t)^2+1)^m$. The case m=n is http://oeis.org/A006139.

$\endgroup$
1
  • $\begingroup$ ..I found it had no beautiful solution...but thx.. $\endgroup$
    – user18717
    Oct 28, 2011 at 15:46

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.