# Odd Fibbinary Numbers and the Golden Ratio

**Authors:** Linus Lindroos, Andrew Sills, and Hua Wang

arXiv: 1812.02107 · 2018-12-06

## TL;DR

None

## Contribution

None

## Abstract

The fibbinary numbers are positive integers whose binary representation contains no consecutive ones. We prove the following result: If the $j$th odd fibbinary is the $n$th \emph{odd} fibbinary number, then $j = \lfloor n\phi^2 \rfloor - 1.$

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1812.02107/full.md

## References

3 references — full list in the complete paper: https://tomesphere.com/paper/1812.02107/full.md

---
Source: https://tomesphere.com/paper/1812.02107