Evaluate $$\sum_{n,k} \frac{1}{\binom{n}{k}}, $$ where the summation ranges over all positive integers $n,k$ with $1<k<n-1$.
Thouhgts:
We are trying to evaluate $$\sum_{n=4}^{\infty} \sum_{k=2}^{n-2} \binom{n}{k}^{-1}$$
We may try to find a closed form of the inner summation which is of the form :
$$ \frac{1}{ {n \choose 2} } + \frac{1}{{n \choose 3} }+ \dotsb + \frac{1}{{n \choose n-2} }. $$
Notice that we may write $\frac{1}{ {n \choose 2} } = \frac{2! }{n(n-1)}$ and if keep doing the same for the other terms we obtain the following:
$$ \frac{ (n-2)! + (n-3)! (n-(n-2)) + (n-4)!(n-(n-2))(n-(n-3)) + \dotsb + 2! (n-3)! }{n!}, $$
which equals
$$ \frac{ (n-2)! + 2!(n-3)! + 3! (n-4)! + \dotsb + (n-3)! 2! }{n!} $$
and so this equals:
$$ \frac{1}{n(n-1)} + \frac{2}{n(n-1)(n-2)} + \dfrac{6}{n(n-1)(n-2)} + \dotsb + \dfrac{2}{n(n-1)(n-2) }. $$
But half of this terms are identical. Therefore, we are trying to sum up series of the form $$\sum_{n \geq k} \frac{1}{(n-1)(n-2)(n-3)\dotso(n-k)} ,$$ which can be done by a telescoping trick, but it seems very formidable. Am I approaching this problem the right way? Any hints/suggestions?
OP, are you sure this have some good closed-form? Or are you looking for limits / Asymptotic behavior of this summation? – Gratus May 16 '20 at 06:47