267914295

Appears in sequences

• a(n) = Fibonacci(2*n+2) - 1.at n=20A035508
• Fibocyclotomic numbers: numbers formed from cyclotomic polynomials and Fibonacci numbers (A000045).at n=41A051258
• Cyclotomic polynomials Phi_n at x=phi divided by sqrt(5) and floored down (where phi = tau = (sqrt(5)+1)/2).at n=41A063704
• Cyclotomic polynomials Phi_n at x=phi, divided by sqrt(5) and rounded to nearest integer (where phi = tau = (sqrt(5)+1)/2).at n=41A063706
• a(n) = Fibonacci(4n+2) - 1, or Fibonacci(2n)*Lucas(2n+2).at n=10A081008
• a(n) = F(n)*L(n+2) where F=Fibonacci and L=Lucas numbers.at n=20A128533
• a(n) = Fibonacci(2*n) - (n mod 2).at n=20A192068
• Number of tilings of an n X 1 rectangle (using tiles of dimension 1 X 1 and 2 X 1) that are not the concatenation of smaller equally-sized tilings.at n=40A224918
• Number of aperiodic tilings of an n X 1 rectangle by tiles of dimension 1 X 1 and 2 X 1.at n=40A225202
• Number of compositions of n into parts 1 and 2 with both parts present.at n=38A245738
• Number of compositions (ordered partitions) of n into parts that do not divide n.at n=43A300702
• a(n) = Fibonacci(n) * Fibonacci(n+1) mod Fibonacci(n+2).at n=40A333599