200690

Appears in sequences

• Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2i+3) = FL(n+3)Product(L(2^i)^bit(n,i),i=0..).at n=12A050612
• a(n) = 196*n^2 - 14.at n=31A158553
• Number of (n+2)X(1+2) arrays of permutations of 0..n*3+5 filled by rows with each element moved 0 or 1 knight moves, and rows and columns in increasing lexicographic order.at n=7A263952
• The number of compositions of n using elements from the set {1,3,5,7,8}.at n=27A349840