query: Is there a known closed form for $\sum_{k=0}^n k\binom{n}{k}^2$?
positive_passages.docid: 19581
positive_passages.text: $\sum_{k=0}^n (-1)^k \binom{n}{k}^2$ and $\sum_{k=0}^n k \binom{n}{k}^2$
negative_passages.docid: 65653
negative_passages.text: Find a closed form of the series $\sum_{n=0}^{\infty} n^2x^n$
negative_passages.docid: 74294
negative_passages.text: How to simplify $\sum_{i=1}^{k}\binom{n + i - 1}{i}$?
negative_passages.docid: 6366
negative_passages.text: Combinatorial proof of summation of $\sum\limits_{k = 0}^n {n \choose k}^2= {2n \choose n}$
negative_passages.docid: 148949
negative_passages.text: Find the value of $\sum_{k=1}^{n} k \binom {n} {k}$
negative_passages.docid: 9046
negative_passages.text: Prove that $\sum_{k=0}^{m}\frac{\binom{m}{k}}{\binom{n}{k}}=\frac{n+1}{n+1-m}$
negative_passages.docid: 5332
negative_passages.text: Find the value of $\sum_0^n \binom{n}{k} (-1)^k \frac{1}{k+1}$
negative_passages.docid: 92754
negative_passages.text: Closed form for the series: $\sum_{n=1}^{\infty}x^{n^2}$
negative_passages.docid: 65672
negative_passages.text: Proof of the summation $n!=\sum_{k=0}^n \binom{n}{k}(n-k+1)^n(-1)^k$?
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: 59252
negative_passages.text: Show $\sum_{k=0}^{m} \binom{n-k}{m-k}=\binom{n+1}{m}$
negative_passages.docid: 19868
negative_passages.text: Evaluate: $ \sum _ {k=1}^{n}{\frac{k}{n}\binom{n}{k}t^k(1-t)^{n-k}}$
negative_passages.docid: 118571
negative_passages.text: Why is $\sum\limits_{k=0}^{n}(-1)^k\binom{n}{k}^2=(-1)^{n/2}\binom{n}{n/2}$ if $n$ is even?
negative_passages.docid: 109576
negative_passages.text: Prove that $\binom{m+n}{m}=\sum\limits_{i=0}^m \binom{m}{i}\binom{n}{i}$
negative_passages.docid: 158774
negative_passages.text: Series of binomial coefficients: $\sum\limits_{n=k}^{\infty}{\binom nk}x^n=\frac{x^k}{(1-x)^{k+1}}$
negative_passages.docid: 99249
negative_passages.text: Sum of product of binomial coefficients: $\sum_{k=0}^{n}(-1)^k\binom{n}{k}\binom{n + k}{k} = (-1)^n$
negative_passages.docid: 133181
negative_passages.text: Hint on how to prove the identity $\sum_{0 \leq k \leq n } \binom{k}{m} = \binom{n + 1}{m + 1}$