On some analogue of the Gelfond problem for Zeckendorf representations

A.O. Gelfond proved that if $b-1$ and $d$ are coprime, the sums of digits of the $b$-ary expressions of natural numbers are uniformly distributed over arithmetic progressions with difference $d$. He also obtained a power estimate for the remainder term in this problem.
We consider an analogue of Gelfond's problem for Zeckendorf representations of naturals as a sum of Fibonacci numbers. It is shown that in this case we again have the uniform distribution of the sums of digits over arithmetic progressions.
Moreover, in the case when the difference of the arithmetic progression $d$ is equal to $2$, it was previously proved that the remainder term of the problem is logarithmic. In the present paper, it is shown that for $d\geq 3$ the remainder term of the problem is a power and an unimprovable in order estimate for it is found.
The proof is based on the detailed study of the remainder term at the Fibonacci numbers. It is shown that the remainder term at an arbitrary point can be estimated through the values of the remainder term in points equal to Fibonacci numbers. For them, it is possible to obtain a linear recurrence relation with constant coefficients, and, moreover, and an exact formula in terms of some Vandermonde determinants connected with the roots of the characteristic polynomial.
Moreover, quite surprisingly, the linear recurrence relation for the remainder term at the Fibonacci points turns out to be connected with some combinatorial triangles, similar to Pascal's triangle.