Number of solutions to c(0)F(0) + ... + c(n)F(n) = 0, where c(i) = +-1 for i >= 0, number of (+1)'s >= number of (-1)'s, F(i) = A000045(i) = Fibonacci numbers.
A058301
Number of solutions to c(0)F(0) + ... + c(n)F(n) = 0, where c(i) = +-1 for i >= 0, number of (+1)'s >= number of (-1)'s, F(i) = A000045(i) = Fibonacci numbers.
Terms
- a(0) =1a(1) =0a(2) =2a(3) =3a(4) =0a(5) =6a(6) =4a(7) =0a(8) =8a(9) =11a(10) =0a(11) =22a(12) =16a(13) =0a(14) =32a(15) =42a(16) =0a(17) =84a(18) =64a(19) =0a(20) =128a(21) =165a(22) =0a(23) =330a(24) =256a(25) =0a(26) =512a(27) =654a(28) =0a(29) =1308
External references
- oeis: A058301