Distribution of Zeckendorf expressions

By Zeckendorf’s Theorem, every positive integer is uniquely written as a sum of distinct non-adjacent Fibonacci terms. In this paper, we investigate the asymptotic formula of the number of binary expansions $<x$ that have no adjacent terms, and generalize the result to the setting of general linear recurrences with non-negative integer coefficients.