3524577

Appears in sequences

• a(n) = Fibonacci(n) - 1.at n=32A000071
• a(n) = Fibonacci(n) + (-1)^n.at n=33A008346
• Pisot sequence T(4,7).at n=28A020732
• a(n) = Fibonacci(2*n + 1) - 1.at n=16A027941
• Sum_{i=0..2n} (C(2n,i) mod 2)*Fibonacci(i+2) = Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2i+2).at n=15A048757
• a(n) = Fibonacci(n+2) - (1-(-1)^n)/2.at n=31A052952
• Numbers formed by interpreting the reduced residue set of every even number as a Zeckendorf Expansion.at n=15A054433
• Third column of triangle A054450 (partial row sums of unsigned Chebyshev triangle A049310).at n=30A054451
• a(n) = Fibonacci(n+1) - (1 + (-1)^n)/2.at n=32A074331
• Odd terms in A027941.at n=5A076684
• a(n) = Fibonacci(4n+1) - 1, or Fibonacci(2n)*Lucas(2n+1).at n=8A081007
• a(n) = F(n)*L(n+1) where F=Fibonacci and L=Lucas numbers.at n=16A081714
• Expansion of (3+x-x^2)/((1+x+x^2)(1-x-x^2)).at n=31A100888
• a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4, with initial terms 0,1,3,3.at n=32A111573
• Alternating sum of the first n Fibonacci numbers.at n=34A119282
• a(2n) = A000045(6n) + 1, a(2n+1) = A000045(6n+3) - 1.at n=11A140413
• a(n) = A000045(n) + A131531(n+3).at n=33A141325
• a(2)=1. a(n) = the largest integer coprime to a(n-1) and less than the n-th Fibonacci number.at n=31A157605
• Number of binary strings of length n with no substrings equal to 0001 0010 or 0110.at n=26A164447
• Number of binary strings of length n with no substrings equal to 0001 0100 or 0101.at n=26A164462