Asymptotic approximation of central binomial coefficients with rigorous error bounds

We show that a well-known asymptotic series for the logarithm of the central binomial coefficient is strictly enveloping in the sense of Pólya and Szegö, so the error incurred in truncating the series is of the same sign as the next term, and is bounded in magnitude by that term. We consider closely related asymptotic series for Binet’s function, for ln Γ ( z + 1 2 ) , and for the Riemann-Siegel theta function, and make some historical remarks.