On the variance of the Fibonacci partition function (Q6187129)

The Fibonacci partition function $R(n)$ counts solutions to $x_1+\cdots+x_s=n$, where $x_1<\cdots<x_s$ are Fibonacci numbers. By Zeckendorf's theorem, $R(n)\geq 1$ ($n\geq 1$), and, clearly, $R(n)=0$ ($n\leq 0$). Its values form the sequence OEIS A000119. The authors note that $R(n)$ is highly erratic and quantify its fluctuations by estimating the second moment \[ V(H):=\sum_{n=0}^H R(n)^2. \] They find that, if $H\geq 1$, $V(H)$ grows like a slightly larger power of $H$ by showing, in their Theorem 1, \[ V(H)\ll H^(\log\lambda_1/\log\varphi)\ll V(H), \] where $\lambda_1\approx 2.48$ is the greatest root of the polynomial $x^3-2x^2-2x$, and $\varphi=(1+\sqrt 5)/2$. The proof involves a diophantine system and an inhomogeneous linear recurrence.