Zeckendorf Representation

A number written as a sum of nonconsecutive Fibonacci Numbers,

$$n=\sum_{k=0}^L \epsilon_kF_k,$$

where $\epsilon_k$ are 0 or 1 and

$$\epsilon_k\epsilon_{k+1}=0.$$

Every Positive Integer can be written uniquely in such a form.

See also Zeckendorf's Theorem

References

Grabner, P. J.; Tichy, R. F.; Nemes, I.; and Pethö, A. ``On the Least Significant Digit of Zeckendorf Expansions.'' Fib. Quart. 34, 147-151, 1996.

Vardi, I. Computational Recreations in Mathematica. Reading, MA: Addison-Wesley, p. 40, 1991.

Zeckendorf, E. ``Représentation des nombres naturels par une somme des nombres de Fibonacci ou de nombres de Lucas.'' Bull. Soc. Roy. Sci. Liège 41, 179-182, 1972.