24157816

Appears in sequences

• a(n) = Fibonacci(n) - 1.at n=36A000071
• Moebius transform of Fibonacci numbers.at n=36A007436
• a(n) = Fibonacci(n) + (-1)^n.at n=37A008346
• Pisot sequence T(4,7).at n=32A020732
• a(n) = Fibonacci(2*n + 1) - 1.at n=18A027941
• a(n) = Fibonacci(n+2) - (1-(-1)^n)/2.at n=35A052952
• Third column of triangle A054450 (partial row sums of unsigned Chebyshev triangle A049310).at n=34A054451
• a(n) = Fibonacci(n+1) - (1 + (-1)^n)/2.at n=36A074331
• a(n) = Fibonacci(4n+1) - 1, or Fibonacci(2n)*Lucas(2n+1).at n=9A081007
• a(n) = F(n)*L(n+1) where F=Fibonacci and L=Lucas numbers.at n=18A081714
• Expansion of (3+x-x^2)/((1+x+x^2)(1-x-x^2)).at n=35A100888
• a(n) = Fibonacci(n) - (Fibonacci(n) mod 2).at n=37A104221
• Number of compositions of n into odd and relatively prime parts.at n=36A108700
• a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4, with initial terms 0,1,3,3.at n=36A111573
• Alternating sum of the first n Fibonacci numbers.at n=38A119282
• a(n) = Fibonacci((prime(n)+3)/2) - 1.at n=18A121569
• a(2)=1. a(n) = the largest integer coprime to a(n-1) and less than the n-th Fibonacci number.at n=35A157605
• Number of binary strings of length n with no substrings equal to 0001 0100 or 0101.at n=30A164462
• 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=36A204291
• a(n) = F(F(n)) mod F(n), where F = Fibonacci = A000045.at n=36A263101