Is there a combinatorial interpretation for:


I do not think there is a simple closed form for it, like:

$$\sum_{i=0}^{n}\binom{2i}{i}\binom{2(n-i)}{n-i} = 4^{n}.$$

Several types of combinatorial proofs are given for this identity.

  • $\begingroup$ Where can I find proof for the second sum in OP's question? $\endgroup$ – Hasek Feb 24 '17 at 10:57

A good tool to apply for such problems is the Online Encyclopedia of Integer Sequences. I computed the first ten value or so of your function of $n$, searched oeis.org, and found an entry for the sequence that contains formulas, asymptotics, references, and so on.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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