We all know the famous theorem that: $$\sum_{i=1}^n\binom{n}{i}=2^n$$ This theorem got me wondering about a similar formula - the properties of the following function: $$I(n)=\int_{0}^{n} \binom{n}{k}\,\,\mathrm{d}k$$ where $n$ is any positive integer and the definition of binomial coefficient is "extended" by way of gamma functions (i.e the integrand is really $\frac{\Gamma(n+1)}{\Gamma(k+1)\Gamma(n-k+1)}$). What I found, experimentally, is pretty cool. It seems that the following is true: $$I(n)=\frac{2}{\pi} \sum_{i=1}^n \binom{n}{i}\operatorname{SinInt}(\pi i)$$ Where $\operatorname{SinInt}(x)$ is the Sine Integral, or $\int_0^x \frac{\sin t}{t}dt$.
To me, this is quite interesting as the Sine Integral tends to $\pi/2$ so the above formula will tend to $2^n$, so the integral is just the sum with some error term. But how would I go about proving it?