Number of representations of n as a sum of Fibonacci numbers (1 is allowed twice as a part).

Terms

a(0) =1a(1) =2a(2) =2a(3) =3a(4) =3a(5) =3a(6) =4a(7) =3a(8) =4a(9) =5a(10) =4a(11) =5a(12) =4a(13) =4a(14) =6a(15) =5a(16) =6a(17) =6a(18) =5a(19) =6a(20) =4a(21) =5a(22) =7a(23) =6a(24) =8a(25) =7a(26) =6a(27) =8a(28) =6a(29) =7