MAX0301

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

initial terms: 10, nil, 1, 11, 110, 1010, nil, 111, 1011, 1110, nil, 1101, 1111, 10110, 11010, nil, 10111, 11011, 11110, 101010, nil, 11111, 101011, 101110, nil, 101101, 101111, 110110, 111010, nil, 110111, 111011, 111110, nil, 111101, 111111, 1010110, 1011010, nil, 1010111, 1011011, 1011110, 1101010, nil, 1011111, 1101011, 1101110, nil, 1101101, 1101111, 1110110, 1111010, nil, 1110111, 1111011, 1111110, 10101010, nil, 1111111, 10101011, 10101110, nil, 10101101, 10101111, 10110110, 10111010, nil, 10110111, 10111011, 10111110, nil, 10111101, 10111111, 11010110, 11011010, nil, 11010111, 11011011, 11011110, 11101010, nil, 11011111, 11101011, 11101110, nil, 11101101, 11101111, 11110110, 11111010, nil, 11110111, 11111011, 11111110, nil, 11111101, 11111111, 101010110, 101011010, nil, 101010111

offset: 1

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