1763581

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=31A001224
• a(n) = (F(2*n-1) + F(n+1))/2 where F(n) is a Fibonacci number.at n=17A005207
• 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=31A060312
• 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=31A068928
• Duplicate of A001224.at n=32A102526
• Expansion of 1/((1-x)*(1-2*x^2)*(1-3*x^3)*(1-4*x^4)*(1-5*x^5)).at n=27A291988