673933

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=29A001224
• a(n) = (F(2*n-1) + F(n+1))/2 where F(n) is a Fibonacci number.at n=16A005207
• 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=29A060312
• 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=29A068928
• Duplicate of A001224.at n=30A102526
• Constant term of the reduction of the polynomial p(n,x)=(1/2)((x+1)^n+(x-1)^n) by x^2->x+1.at n=16A192352