5702886

Appears in sequences

• a(n) = Fibonacci(n) - 1.at n=33A000071
• Fibonacci(n) - (-1)^n.at n=33A007492
• Pisot sequence T(4,7).at n=29A020732
• a(n) = Fibonacci(2*n+2) - 1.at n=16A035508
• Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2i+3) = FL(n+3)Product(L(2^i)^bit(n,i),i=0..).at n=15A050612
• a(n) = Fibonacci(4n+2) - 1, or Fibonacci(2n)*Lucas(2n+2).at n=8A081008
• Expansion of (3+x-x^2)/((1+x+x^2)(1-x-x^2)).at n=32A100888
• a(n) = Fibonacci(n) - (Fibonacci(n) mod 2).at n=34A104221
• Number of compositions of n into odd and relatively prime parts.at n=33A108700
• a(n) = a(n-1) + a(n-3) + a(n-4).at n=33A115008
• a(n) = F(n)*L(n+2) where F=Fibonacci and L=Lucas numbers.at n=16A128533
• Number of binary strings of length n with no substrings equal to 0001 0010 or 0110.at n=27A164447
• First differences of A116697.at n=32A186679
• a(n) = Fibonacci(2*n) - (n mod 2).at n=16A192068
• Number of compositions of n into parts 1 and 2 with both parts present.at n=30A245738
• a(n) = Fibonacci(n) * Fibonacci(n+1) mod Fibonacci(n+2).at n=32A333599