1, 2, 3, 5, 8, 13
.
The decimal number eleven can be written as 0*13 + 1*8 + 0*5 + 1*3 + 0*2 + 0*1
or 010100
in positional notation where the columns represent multiplication by a particular member of the sequence. Leading zeroes are dropped so that 11 decimal becomes 10100
. 10100 is not the only way to make 11 from the Fibonacci numbers however 0*13 + 1*8 + 0*5 + 0*3 + 1*2 + 1*1
or 010011 would also represent decimal 11. For a true Zeckendorf number there is the added restriction that no two consecutive Fibonacci numbers can be used which leads to the former unique solution.
n
Zeckendorf numbers in order.
zeckendorf
function should return the correct answer
testString: assert.deepEqual(answer, solution20, 'Your zeckendorf
function should return the correct answer');
```