Summation of series defined by counting blocks of digits (Q868903)

Let \(w = d_1d_2\cdots d_k\) a block (of length \(k\)) of digits \(d_j \{0,1\}\) and \(N_w(n)\) the number of occurences of \(w\) in the binary expansion of the natural number \(n\). The authors provide explicit sum representations of the series \[ \sum_{n\geq 1} \frac{N_w(n)}{2n(2n+1)}\qquad\text{and} \qquad \sum_{n\geq 1} \frac{N_w(n)}{2n(2n+1)(2n+2)} \] in terms of Euler's constant, the gamma-function and the logarithmic derivative of the gamma-function. The idea of the proof is to use a general summation lemma of [\textit{J.-P. Allouche} and \textit{J. Shallit}, Sums of digits and the Hurwitz zeta function. Analytic number theory, Proc. Jap.-Fr. Symp., Tokyo/Jap. 1988, Lect. Notes Math. 1434, 19--30 (1990; Zbl 0711.11003)].