Abstract.We apply the Euler–Maclaurin formula to find the asymptotic expansion of the sums $$\sum\nolimits_{k=1}^n (\log k)^p/k^q$$, $$\sum k^q(\log k)^p$$, $$\sum(\log k)^p/(n- k)^q$$, $$\sum 1/k^q(\log k)^p$$ in closed form to arbitrary order $$(p, q \in \mathbb{N})$$. The expressions often simplify considerably and the coefficients are recognizable constants. The constant terms of the asymptotics are either $$\zeta^{(p)}({\pm}q)$$ (first two sums), 0 (third sum) or yield novel mathematical constants (fourth sum). This allows numerical computation of $$\zeta^{(p)}({\pm}q)$$ faster than any current software. One of the constants also appears in the expansion of the function $$\sum\nolimits_{n\geqslant 2}(n \log n)^{-s}$$ around the singularity at s = 1; this requires the asymptotics of the incomplete gamma function. The manipulations involve polylogs for which we find a representation in terms of Nielsen integrals, as well as mysterious conjectures for Bernoulli numbers. Applications include the determination of the asymptotic growth of the Taylor coefficients of $$(-z/ \log(1-z))^k$$. We also give the asymptotics of Stirling numbers of first kind and their formula in terms of harmonic numbers.
[1]
Hsien-Kuei Hwang,et al.
Asymptotic expansions for the Stirling numbers of the first kind
,
1995
.
[2]
George Polya,et al.
Induction and Analogy in Mathematics
,
1954
.
[3]
N. D. Bruijn.
Asymptotic methods in analysis
,
1958
.
[4]
Herbert S. Wilf.
The Asymptotic Behavior of the Stirling Numbers of the First Kind
,
1993,
J. Comb. Theory, Ser. A.
[5]
Charles Knessl,et al.
Stirling number asymptotics from recursion equations using the ray method
,
1991
.
[6]
Philippe Flajolet,et al.
Singularity Analysis of Generating Functions
,
1990,
SIAM J. Discret. Math..