OFFSET
0,1
COMMENTS
Main entry: A389380.
This is the approximation described in A277002/A277003 (see also A189048/A189049), truncated to the first term.
This variant is attributed to Burnside but was the first one Stirling discovered, then simplified into the standard approximation named after him. However, this has asymptotically half the error (and is an upper bound instead of lower).
Multiplying Stirling's nominal approximation by e^(1/(12*n)) and his original (this one) by e^(-1/(24*m)) flips their inequalities.
Note that while Stirling's nominal can be evaluated for n > 0, his original can be for n>-1/2; the product over all positive half-integer n is 2^(1/4) * A / e^(gamma/12+3/8), where A = A074962.
LINKS
Jonathan M. Borwein and Robert M. Corless, Gamma and Factorial in the Monthly, Amer. Math. Monthly, 125(5) (2018), 400-424; arXiv version, arXiv:1703.05349 [math.HO], 2017.
Natalia L. Skirrow, Stirling's approximations
FORMULA
Equals Pi^(-1/2)*(exp(13 - gamma - 12*zeta'(-1))/2)^(1/24). - Peter Luschny, Oct 14 2025
EXAMPLE
0.99908093296568954102773981568058...
MAPLE
split := r -> ListTools:-Reverse(convert(floor(r), base, 10)):
Digits := 120: Pi^(-1/2)*(exp(13 - gamma - 12*Zeta(1, -1))/2)^(1/24):
split(evalf(%) * 10^100); # Peter Luschny, Oct 14 2025
MATHEMATICA
RealDigits[Sqrt[E*Glaisher/Pi]/(2*E^EulerGamma)^(1/24), 10, 128][[1]]
CROSSREFS
KEYWORD
nonn,cons
AUTHOR
Natalia L. Skirrow, Sep 28 2025
STATUS
approved
