Abstract
We obtain the asymptotic formula for the sum $S(X)=\sum_{n<X}\varepsilon(n)\varepsilon(n+1)$, where $\varepsilon(n)$ takes the value +1 or -1 depending on the parity of the expansion of the sum of the digits n in the Fibonacci numeration system.
Publisher
Institute for Applied Mathematics, Far Eastern Branch, Russian Academy of Sciences
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献