39088168

Appears in sequences

• a(n) = Fibonacci(n) - 1.at n=37A000071
• Fibonacci(n) - (-1)^n.at n=37A007492
• Pisot sequence T(4,7).at n=33A020732
• a(n) = Fibonacci(2*n+2) - 1.at n=18A035508
• Fibocyclotomic numbers: numbers formed from cyclotomic polynomials and Fibonacci numbers (A000045).at n=37A051258
• Cyclotomic polynomials Phi_n at x=phi divided by sqrt(5) and floored down (where phi = tau = (sqrt(5)+1)/2).at n=37A063704
• 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=37A063706
• a(n) = Sum_{1<=k<=n, gcd(k,n)=1} Fibonacci(k).at n=36A070964
• a(n) = Fibonacci(4n+2) - 1, or Fibonacci(2n)*Lucas(2n+2).at n=9A081008
• a(n) = Fibonacci(n) - (Fibonacci(n) mod 2).at n=38A104221
• Number of compositions of n into odd and relatively prime parts.at n=37A108700
• a(n) = a(n-1) + a(n-3) + a(n-4).at n=37A115008
• a(n) = Fibonacci((prime(n)+3)/2) - 1.at n=19A121569
• a(n) = F(n)*L(n+2) where F=Fibonacci and L=Lucas numbers.at n=18A128533
• First differences of A116697.at n=36A186679
• a(n) = Fibonacci(2*n) - (n mod 2).at n=18A192068
• 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=36A224918
• Number of aperiodic tilings of an n X 1 rectangle by tiles of dimension 1 X 1 and 2 X 1.at n=36A225202
• Number of compositions of n into parts 1 and 2 with both parts present.at n=34A245738
• a(n) = Fibonacci(n) * Fibonacci(n+1) mod Fibonacci(n+2).at n=36A333599