Sums with Stern-Brocot sequences and the Minkowski question-mark function (Q6876561)

The Stern-Brocot sequences \((F_n)\) (defined using an infinite complete binary tree whose vertices correspond to the positive rational numbers with values ordered left to the right as in a binary search tree may be used to define the so-called Minkowski `question mark' function \(?\), known to be continuous, strictly increasing, singular and known to satisfy the functional equations \(?(1-x)=1-?(x)\) and \(?\bigl(\frac{x}{1+x}\bigr)=\frac{?(x)}{2}\). Here an analogue of \textit{J. Franel}'s theorem [Nachr. Ges. Wiss. Göttingen, Math.-Phys. Kl. 1924, 198--201 (1924; JFM 50.0119.01)] on the distribution of the Farey numbers is shown for \(?\) and the Stern-Brocot sequences is shown, and further results include an analysis of the Fourier-Stieltjes coefficients of the inverse of \(?\).