104069

Appears in sequences

• a(n) = T(n,n-3), T given by A026568. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=3.at n=12A026572
• Duplicate of A026572.at n=12A026588
• a(n)=Sum{T(n,k)*T(n,k+2)}, 0<=k<=2n-2, T given by A027926.at n=7A027996
• a(n) = Sum_{k=0..n} binomial(n+2*k,n-k) * Fibonacci(k+1).at n=9A390825