OFFSET
0,1
COMMENTS
From Peter Bala, Aug 24 2025: (Start)
By definition, the Euler-Mascheroni constant gamma = lim_{n -> oo} s(n), where s(n) = Sum_{k = 1..n} 1/k - log(n). The convergence is slow. For example, s(50) = 0.5(87...) is only correct to 1 decimal digit. Let S(n) = Sum_{k = 0..n} (-1)^(n+k)*binomial(n, k)*binomial(n+k, k)*s(n+k). Elsner shows that S(n) converges to gamma much more rapidly. For example, S(50) = 0.57721566490153286060651209008(02...) gives gamma correct to 29 decimal digits.
Define E(n) = Sum_{k = 0..n} (-1)^(n+k)*binomial(n, k)*binomial(n+k, k)*log(s(n+k)). Then it appears that E(n) converges rapidly to log(gamma). For example, E(50) = -0.549539312981644822337661768802(88...) gives log(gamma) correct to 30 decimal digits. Cf. A073004. (End)
REFERENCES
W. E. Mansell, Tables of Natural and Common Logarithms. Royal Society Mathematical Tables, Vol. 8, Cambridge Univ. Press, 1964, p. XVIII.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Ivan Panchenko, Table of n, a(n) for n = 0..1000
C. Elsner, On a sequence transformation with integral coefficients for Euler's constant, Proc. Amer. Math. Soc., Vol. 123 (1995), Number 5, pp. 1537-1541.
Simon Plouffe, -log(gamma) to 10000 digits
Simon Plouffe, -log(gamma) to 1024 digits
EXAMPLE
.549539312981644822337661768802907788330698981263...
MATHEMATICA
RealDigits[-Log[EulerGamma], 10, 100][[1]] (* G. C. Greubel, Sep 07 2018 *)
PROG
(PARI) -log(Euler) \\ Michel Marcus, Mar 11 2013
(Magma) SetDefaultRealField(RealField(100)); R:= RealField(); -Log(EulerGamma(R)); // G. C. Greubel, Sep 07 2018
CROSSREFS
KEYWORD
nonn,cons
AUTHOR
STATUS
approved
