MIN0102

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

initial terms: 1, 10, 100, 101, 1000, 1001, 1010, 10000, 10001, 10010, 10100, 10101, 100000, 100001, 100010, 100100, 100101, 101000, 101001, 101010, 1000000, 1000001, 1000010, 1000100, 1000101, 1001000, 1001001, 1001010, 1010000, 1010001, 1010010, 1010100, 1010101, 10000000, 10000001, 10000010, 10000100, 10000101, 10001000, 10001001, 10001010, 10010000, 10010001, 10010010, 10010100, 10010101, 10100000, 10100001, 10100010, 10100100, 10100101, 10101000, 10101001, 10101010, 100000000, 100000001, 100000010, 100000100, 100000101, 100001000, 100001001, 100001010, 100010000, 100010001, 100010010, 100010100, 100010101, 100100000, 100100001, 100100010, 100100100, 100100101, 100101000, 100101001, 100101010, 101000000, 101000001, 101000010, 101000100, 101000101, 101001000, 101001001, 101001010, 101010000, 101010001, 101010010, 101010100, 101010101, 1000000000, 1000000001, 1000000010, 1000000100, 1000000101, 1000001000, 1000001001, 1000001010, 1000010000, 1000010001, 1000010010, 1000010100

offset: 1

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