Consider the following limit: $$\lim_{n\to\infty}{\sum_{m=0}^{n}{\sum_{k=0}^{n-m}{\left[\frac{2^{n-m-k}}{n-m+1}\,\frac{{{2k}\choose{k}}{{2m}\choose{m}}}{{{2n}\choose{n}}}\right]}}}=\pi$$ I cooked this up while playing around with power series (details below).
Is there a more direct way to prove this limit?
Consider the functions $f(x)=\frac{\tan^{-1}(\sqrt{1-x})}{\sqrt{1-x}}$, $g(x)=\frac{\pi/2-\tan^{-1}(\sqrt{1-x})}{\sqrt{1-x}}$. We write the power series: $$f(x)=\sum_{n=0}^{\infty}{(s_n\pi-r_n)x^n},\qquad{g}(x)=\sum_{n=0}^{\infty}{(s_n\pi+r_n)x^n}$$ where computing the first few terms suggests that $r_n$, $s_n$ are rational.
Indeed, we have $\frac{\pi/4-\tan^{-1}(\sqrt{1-x})}{\sqrt{1-x}}=\frac{g(x)-f(x)}{2}=\sum{r_nx^n}$, and $\frac{1/4}{\sqrt{1-x}}=\frac{g(x)+f(x)}{2\pi}=\sum{s_nx^n}$.
Using $\frac{d}{dx}[\tan^{-1}(\sqrt{1-x})]=-\frac{1}{2(2-x)\sqrt{1-x}}$, we can use the power series for $\frac{1}{2-x}$ and $\frac{1}{\sqrt{1-x}}$ to calculate the power series for $(\pi/4-\tan^{-1}(\sqrt{1-x}))$, which consists of only rational coefficients. Combining this with the power series for $\frac{1}{\sqrt{1-x}}$ gives: $$r_n=\frac{1}{2}\sum_{m=0}^{n-1}{\sum_{k=0}^{n-m-1}{\frac{{{2k}\choose{k}}{{2m}\choose{m}}}{(n-m)\cdot2^{k+m+n}}}}$$ We easily get $s_n=\frac{1}{2^{2n+2}}{2n\choose{n}}$.
Now, because no branch of $f(z)$ has singularities anywhere (the apparent singularity at $z=1$ is removable), the coefficients of the power series of $f$ must tend to zero.
Hence $\lim_{n\to\infty}{\frac{r_{n+1}}{s_{n+1}}}=\pi$, and the desired limit follows after simplifying.
Notes:
1) It is easily shown that: $$s_n\pi-r_n=\int_{0}^{\pi/4}{\sin^{2n}{\theta}\,d\theta},\qquad{s}_n\pi+r_n=\int_{\pi/4}^{\pi/2}{\sin^{2n}{\theta}\,d\theta}$$
2) The above proof actually shows: $$\lim_{n\to\infty}{\left(1+\frac{1}{2n+1}\right)\sum_{m=0}^{n}{\sum_{k=0}^{n-m}{\left[\frac{2^{n-m-k}}{n-m+1}\,\frac{{{2k}\choose{k}}{{2m}\choose{m}}}{{{2n}\choose{n}}}\right]}}}=\pi$$ which converges much faster than the given limit.