The following is the recursive FFT procedure of Algorithm for evaluationg a polynomial of length $N$ at $N$ Fourier points.
Algorithm (FFT - fast Fourier transform).
Input arguments.
$ \ \ $ integer $N=2^m$
$ \ \ $ polynomial
$\alpha (x)=\sum_{i=0}^{N-1}\alpha_i x^i$ $ \ \ $...
In mathematics, the Stieltjes constants are the numbers that occur in the Laurent series expansion of the Riemann zeta function:
The zero'th constant is known as the Euler–Mascheroni constant.
== Representations ==
The Stieltjes constants are given by the limit
(In the case n = 0, the first summand requires evaluation of 00, which is taken to be 1.)
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...
