Tuesday, 11 September 2018

combinatorics - Evaluate sumnk=1frac1kbinomnk





I'm interested in finding a nice closed form expression for the sum nk=11k(nk). I've tried using the Binomial Theorem to get
nk=11k(nk)xk=10(1+x)n1xdx=21(1+u++un1)du

using the substitution u=1+x but I can't quite to simplify this integral either. I have also not been able to come up with a combinatorial approach, which may not exist since the summation and its terms are in general not integers. Any help in evaluating this sum would be appreciated, thanks!


Answer



In the question, the problem is in "nice closed form expression" since
nk=11k(nk)xk=nx3F2(1,1,1n;2,2;x) where appears an hypergoemetric function.



So, let us forget the x and compute for a few values of n
Sn=nk=11k(nk)
{1,52,296,10312,88760,151760,18239420} which are
{1,52,296,20624,1774120,18204720,2188685040} The denominators are clearly n! and the numerators corresponds to sequence A103213 in OEIS.



As you will see in the link is that, for large n

Sn2n+1n It is also given that
Sn=Hn(B2(n+1,0)) where appear the harmonic number and the real part of the incomplete beta function.



Update



Concerning the asymptotic behavior, it seems that it could be slightly improved using
Sn2n+1n14n1


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...