Digital Sums and Divide-and-Conquer Recurrences: Fourier Expansions and Absolute Convergence

We propose means for computing the Fourier expansions of periodic functions appearing in higher moments of the sum-of-digits function and in the solutions of some divide-and-conquer recurrences. The expansions are shown to be absolutely convergent. We also give a new approach to efficiently compute numerically the coefficients involved to high precision.