701408732

Appears in sequences

• a(n) = 7*a(n-1) - a(n-2) + 5.at n=10A003481
• a(n) = Fibonacci(2*n+2) - 1.at n=21A035508
• Fibocyclotomic numbers: numbers formed from cyclotomic polynomials and Fibonacci numbers (A000045).at n=43A051258
• Cyclotomic polynomials Phi_n at x=phi divided by sqrt(5) and floored down (where phi = tau = (sqrt(5)+1)/2).at n=43A063704
• 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=43A063706
• a(n) = Fibonacci(4n) - 1, or Fibonacci(2n+1)*Lucas(2n-1).at n=10A081006
• Three consecutive elements of the sequence built from a quadratic form over four consecutive Fibonacci numbers A000045.at n=16A114695
• a(n) = F(n)*L(n-2) where F = Fibonacci and L = Lucas numbers.at n=23A128535
• 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=42A224918
• Number of aperiodic tilings of an n X 1 rectangle by tiles of dimension 1 X 1 and 2 X 1.at n=42A225202
• a(n) = gcd(Sum_{k=1...n} F(k), Product{j=1...n} F(j)), where F(k) is the k-th Fibonacci number.at n=41A239740
• Number of compositions of n into parts 1 and 2 with both parts present.at n=40A245738
• a(n) = Fibonacci(n) * Fibonacci(n+1) mod Fibonacci(n+2).at n=42A333599