Everything about Negafibonacci coding

🧭 Start here: a 6-step reading path

1. Read the overview: Negafibonacci codingA 5-minute orientation
2. Go sideways: Zeckendorf's theoremA closely related topic
3. Go sideways: Fibonacci codingA closely related topic

🏆 Landmark papers (most cited)

• No matching papers found.

📚 Books worth reading

Open Library didn't respond; try again in a moment.

🔗 Related topics

• Zeckendorf's theorem Zeckendorf's theorem, named after amateur mathematician Edouard Zeckendorf, is a result about the representation of integers as sums of Fibonacci numbers…
• Fibonacci coding In mathematics and computing, Fibonacci coding is a universal code which encodes positive integers into binary code words. It is one example of representations…
• Fibonacci sequence In mathematics, the Fibonacci sequence is a sequence in which each element is the sum of the two elements that precede it. Numbers that are part of the…
• Fibbinary number In mathematics, the fibbinary numbers are the numbers whose binary representation does not contain two consecutive ones. That is, they are sums of distinct…
• Moser–de Bruijn sequence In number theory, the Moser–de Bruijn sequence is an integer sequence named after Leo Moser and Nicolaas Govert de Bruijn, consisting of the sums of distinct…
• Generalizations of Fibonacci numbers In mathematics, the Fibonacci numbers form a sequence defined recursively by: Fn={0n=01n=1Fn−1+Fn−2n>1 That is, after two starting values, each number…
• Digit sum In mathematics, the digit sum of a natural number in a given number base is the sum of all its digits. For example, the digit sum of the decimal number…
• Sequence In mathematics, a sequence is a collection of objects possibly with repetition, that come in a specified order. Like a set, it contains members (also called…