MAX0102

description: maximum representation of n in base of Fibonacci-type sequence beginning 1, 2, 3, 5, 8, ...

initial terms: 1, 10, 11, 101, 110, 111, 1010, 1011, 1101, 1110, 1111, 10101, 10110, 10111, 11010, 11011, 11101, 11110, 11111, 101010, 101011, 101101, 101110, 101111, 110101, 110110, 110111, 111010, 111011, 111101, 111110, 111111, 1010101, 1010110, 1010111, 1011010, 1011011, 1011101, 1011110, 1011111, 1101010, 1101011, 1101101, 1101110, 1101111, 1110101, 1110110, 1110111, 1111010, 1111011, 1111101, 1111110, 1111111, 10101010, 10101011, 10101101, 10101110, 10101111, 10110101, 10110110, 10110111, 10111010, 10111011, 10111101, 10111110, 10111111, 11010101, 11010110, 11010111, 11011010, 11011011, 11011101, 11011110, 11011111, 11101010, 11101011, 11101101, 11101110, 11101111, 11110101, 11110110, 11110111, 11111010, 11111011, 11111101, 11111110, 11111111, 101010101, 101010110, 101010111, 101011010, 101011011, 101011101, 101011110, 101011111, 101101010, 101101011, 101101101, 101101110, 101101111

offset: 1

link: Ron Knott, Using the Fibonacci Numbers to Represent Whole Numbers.