Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2i+1) = FL(n+1)Product(L(2^i)^bit(n,i),i=0..).

Terms

a(0) =1a(1) =3a(2) =6a(3) =21a(4) =35a(5) =126a(6) =273a(7) =987a(8) =1598a(9) =5781a(10) =12549a(11) =45402a(12) =76657a(13) =277347a(14) =602070a(15) =2178309a(16) =3524579a(17) =12752046a(18) =27682401a(19) =100155867a(20) =169104754a(21) =611826747a(22) =1328165979a(23) =4805349654a(24) =7782268225a(25) =28156510947a(26) =61122728166a(27) =221144107989