The Stieltjes constants are given by the limit Cauchy's differentiation formula leads to the integral representation Various representations in terms of integrals and infinite series are given in works of Jensen, Franel, Hermite, Hardy, Ramanujan, Ainsworth, Howell, Coppo, Connon, Coffey, Choi, Blagouchine and some other authors. In particular, Jensen-Franel's integral formula, often erroneously attributed to Ainsworth and Howell, states that where δn,k is the Kronecker symbol. Among other formulae, we find see. As concerns series representations, a famous series implying an integer part of a logarithm was given by Hardy in 1912 Israilov gave semi-convergent series in terms of Bernoulli numbers Connon, Blagouchine and Coppo gave several series with the binomial coefficients where Gn are Gregory's coefficients, also known as . More general series of the same nature include these examples and or where are the Bernoulli polynomials of the second kind and are the polynomials given by the generating equation respectively. Oloa and Tauraso showed that series with harmonic numbers may lead to Stieltjes constants Blagouchine obtained slowly-convergent series involving unsigned Stirling numbers of the first kind as well as semi-convergent series with rational terms only where m=0,1,2,... In particular, series for the first Stieltjes constant has a surprisingly simple form where Hn is the nth harmonic number. More complicated series for Stieltjes constants are given in works of Lehmer, Liang, Todd, Lavrik, Israilov, Stankus, Keiper, Nan-You, Williams, Coffey.
The Stieltjes constants satisfy the bound given by Berndt in 1972. Better bounds in terms of elementary functions were obtained by Lavrik by Israilov with k=1,2,... and C=1/2, C=7/12,..., by Nan-You and Williams by Blagouchine where Bn are Bernoulli numbers, and by Matsuoka As concerns estimations resorting to non-elementary functions and solutions, Knessl, Coffey and Fekih-Ahmed obtained quite accurate results. For example, Knessl and Coffey give the following formula that approximates the Stieltjes constants relatively well for large n. If v is the unique solution of with, and if, then where Up to n = 100000, the Knessl-Coffey approximation correctly predicts the sign of γn with the single exception of n = 137.
Numerical values
The first few values are: For large n, the Stieltjes constants grow rapidly in absolute value, and change signs in a complex pattern. Further information related to the numerical evaluation of Stieltjes constants may be found in works of Keiper, Kreminski, Plouffe, Johansson and Blagouchine. First, Johansson provided values of the Stieltjes constants up to n = 100000, accurate to over 10000 digits each for large and complex, which can be also used for ordinary Stieltjes constants. In particular, it allows one to compute to 1000 digits in a minute for any up to .
Generalized Stieltjes constants
General information
More generally, one can define Stieltjes constants γn that occur in the Laurent series expansion of the Hurwitz zeta function: Here a is a complex number with Re>0. Since the Hurwitz zeta function is a generalization of the Riemann zeta function, we have γn=γn The zero'th constant is simply the digamma-function γ0=-Ψ, while other constants are not known to be reducible to any elementary or classical function of analysis. Nevertheless, there are numerous representations for them. For example, there exists the following asymptotic representation due to Berndt and Wilton. The analog of Jensen-Franel's formula for the generalized Stieltjes constant is the Hermite formula Similar representations are given by the following formulas: and Generalized Stieltjes constants satisfy the following recurrence relation as well as the multiplication theorem where denotes the binomial coefficient.
First generalized Stieltjes constant
The first generalized Stieltjes constant has a number of remarkable properties.
Malmsten's identity : the reflection formula for the first generalized Stieltjes constant has the following form
where m and n are positive integers such that m<n. This formula has been long-time attributed to Almkvist and Meurman who derived it in 1990s. However, it was recently reported that this identity, albeit in a slightly different form, was first obtained by Carl Malmsten in 1846.
Rational arguments theorem: the first generalized Stieltjes constant at rational argument may be evaluated in a quasi-closed form via the following formula
see Blagouchine. An alternative proof was later proposed by Coffey and several other authors.
Finite summations: there are numerous summation formulae for the first generalized Stieltjes constants. For example,
For more details and further summation formulae, see.
Some particular values: some particular values of the first generalized Stieltjes constant at rational arguments may be reduced to the gamma-function, the first Stieltjes constant and elementary functions. For instance,
At points 1/4, 3/4 and 1/3, values of first generalized Stieltjes constants were independently obtained by Connon and Blagouchine At points 2/3, 1/6 and 5/6 These values were calculated by Blagouchine. To the same author are also due
Second generalized Stieltjes constant
The second generalized Stieltjes constant is much less studied than the first constant. Similarly to the first generalized Stieltjes constant, the second generalized Stieltjes constant at rational argument may be evaluated via the following formula see Blagouchine. An equivalent result was later obtained by Coffey by another method.