1346268

Appears in sequences

• a(n) = Fibonacci(n) - 1.at n=30A000071
• Moebius transform of Fibonacci numbers.at n=30A007436
• a(n) = Fibonacci(n) + (-1)^n.at n=31A008346
• Pisot sequence T(4,7).at n=26A020732
• a(n) = Fibonacci(2*n + 1) - 1.at n=15A027941
• a(n) = Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2*i).at n=15A051656
• a(n) = Fibonacci(n+2) - (1-(-1)^n)/2.at n=29A052952
• Third column of triangle A054450 (partial row sums of unsigned Chebyshev triangle A049310).at n=28A054451
• a(n) = Fibonacci(n+1) - (1 + (-1)^n)/2.at n=30A074331
• a(n) = Fibonacci(n+1)+cos(n*Pi/2).at n=30A074662
• a(n) = Fibonacci(4n+3) - 1, or Fibonacci(2n+2)*Lucas(2n+1).at n=7A081009
• Expansion of (3+x-x^2)/((1+x+x^2)(1-x-x^2)).at n=29A100888
• a(n) = Fibonacci(n) - (Fibonacci(n) mod 2).at n=31A104221
• Number of compositions of n into odd and relatively prime parts.at n=30A108700
• Alternating sum of the first n Fibonacci numbers.at n=32A119282
• a(n) = Fibonacci((prime(n)+3)/2) - 1.at n=15A121569
• a(n) = Fibonacci(n)*Lucas(n-1).at n=16A128534
• a(2)=1. a(n) = the largest integer coprime to a(n-1) and less than the n-th Fibonacci number.at n=29A157605
• 0-sequence of reduction of Lucas sequence by x^2 -> x+1.at n=15A192243
• G.f.: Sum_{n>=1} moebius(n)*x^n/(1 - Lucas(n)*x^n + (-1)^n*x^(2*n)), where Lucas(n) = A000204(n).at n=30A204291