76657domain: NAppears in sequencesSum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2i+1) = FL(n+1)Product(L(2^i)^bit(n,i),i=0..).at n=12A050611Numerator of Euler(n,4).at n=9A157808The number of compositions of n using elements from the set {1,3,5,7,8}.at n=25A349840