Number of representations of n as a sum of Fibonacci numbers (1 is allowed twice as a part).
1, 2, 2, 3, 3, 3, 4, 3, 4, 5, 4, 5, 4, 4, 6, 5, 6, 6, 5, 6, 4, 5, 7, 6, 8, 7, 6, 8, 6, 7, 8, 6, 7, 5
1 seqfan posts
Fri Oct 29 05:35:16 CEST 2010 [seqfan] Implementing first 500 sequences in Java