Infinite Products Associated with Counting Blocks in Binary Strings

From MaRDI portal





Let \(w\) be a string of 0's and 1's, and let \(a_w(n)\) be the function which counts the number of (possibly overlapping) occurrences of \(w\) in the binary expansion of \(n\). We show that there exists an effectively computable rational function \(b_w(n)\) such that \[ \sum_{n\geq 0}\log_2(b_w(n))X^{a_w(n)}=-\frac{1}{1-X}. \] By setting \(X=-1\) and exponentiating, we recover previous results and also obtain some new ones; for example, \[ \prod_{n\geq 1}\left(\frac{2n}{2n+1}\right)^{(- 1)^{a_0(n)}}=\frac{\sqrt{2}}{2}. \] Our work is a generalization of previous results of D. Woods, D. Robbins, H. Cohen, M. Mendès France, and the authors.











This page was built for publication: Infinite Products Associated with Counting Blocks in Binary Strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765780)