query: Compute the following sum in terms of an expression having only one binomial coefficient
positive_passages.docid: 17551
positive_passages.text: Truncated alternating binomial sum
negative_passages.docid: 87589
negative_passages.text: Evaluate $\binom{n}{0}+\binom{n}{2}+\binom{n}{4}+...+\binom{n}{2k}$
negative_passages.docid: 59638
negative_passages.text: How to prove this result on binomial coefficients?
negative_passages.docid: 83229
negative_passages.text: Nested summations and their relation to binomial coefficients
negative_passages.docid: 115433
negative_passages.text: Find the summation of given expression: $\sum_{k=1}^n k^3\binom nk$
negative_passages.docid: 59252
negative_passages.text: Show $\sum_{k=0}^{m} \binom{n-k}{m-k}=\binom{n+1}{m}$
negative_passages.docid: 131468
negative_passages.text: Summation of Central Binomial Coefficients divided by even powers of $2$
negative_passages.docid: 40784
negative_passages.text: $\sum_{k=m}^{n}(-1)^k\binom{n}{k}\binom{k}{m}=0, n>m\geq 0$
negative_passages.docid: 126214
negative_passages.text: Multiplying Binomial Terms
negative_passages.docid: 116491
negative_passages.text: Closed form for $\sum_{k=0}^{m} {\binom {m}{k}} a^{k} (b+ck)^N$
negative_passages.docid: 482
negative_passages.text: Express $1 + \frac {1}{2} \binom{n}{1} + \frac {1}{3} \binom{n}{2} + \dotsb + \frac{1}{n + 1}\binom{n}{n}$ in a simplifed form
negative_passages.docid: 70248
negative_passages.text: Closed-form expression for $\sum_{k=0}^n\binom{n}kk^p$ for integers $n,\,p$
negative_passages.docid: 146762
negative_passages.text: Closed form for $\sum_{k=0}^{n} \binom{n}{k}\frac{(-1)^k}{(k+1)^2}$
negative_passages.docid: 108401
negative_passages.text: Sum of binomial coefficients $\sum_{k=0}^{n}(-1)^k\binom{n}{k}\binom{2n - 2k}{n - 1} = 0$
negative_passages.docid: 1379
negative_passages.text: Summation of $n^2x^n$ terms
negative_passages.docid: 91239
negative_passages.text: Sum of binomial coefficients involving $n,p,q,r$
negative_passages.docid: 110441
negative_passages.text: Closed form for a formula with a summation over $i\binom{n-i}{k-1}$, and combinatorial proof?