7466468

Appears in sequences

• If F(n) is the n-th Fibonacci number, then a(2n) = (F(2n+1) + F(n+2))/2 and a(2n+1) = (F(2n+2) + F(n+1))/2.at n=34A001224
• a(n)=Sum{T(2i,n-2i): i=0,1,...,[ n/2 ]}, array T as in A049600.at n=18A049601
• Number of positive rational knots with 2n+1 crossings.at n=17A051450
• Number of distinct ways to tile a 2 X n rectangle with dominoes (solutions are identified if they are rotations or reflections of each other).at n=34A060312
• Number of incongruent ways to tile a 3 X 2n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.at n=34A068928
• Duplicate of A001224.at n=35A102526