12752046domain: 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=17A050611a(n) = Lucas(4*n+2) + 3, or Lucas(2*n)*Lucas(2*n+2).at n=8A081077a(n) = L(n)^2 - 5*(-1)^n = L(n+1)*L(n-1), where L = A000032.at n=17A292696a(n) = Lucas(n) + 3.at n=33A366506