514228

Appears in sequences

• a(n) = Fibonacci(n) - 1.at n=28A000071
• Moebius transform of Fibonacci numbers.at n=28A007436
• a(n) = Fibonacci(n) + (-1)^n.at n=29A008346
• Pisot sequence T(4,7).at n=24A020732
• a(n) = Fibonacci(2*n + 1) - 1.at n=14A027941
• a(n) = Fibonacci(n+2) - (1-(-1)^n)/2.at n=27A052952
• Third column of triangle A054450 (partial row sums of unsigned Chebyshev triangle A049310).at n=26A054451
• a(n) = phi(Fibonacci(n)).at n=29A065449
• a(n) = Fibonacci(n+1) - (1 + (-1)^n)/2.at n=28A074331
• a(n) = Fibonacci(4n+1) - 1, or Fibonacci(2n)*Lucas(2n+1).at n=7A081007
• a(n) = F(n)*L(n+1) where F=Fibonacci and L=Lucas numbers.at n=14A081714
• a(n) = Fibonacci(n) - (Fibonacci(n) mod 2).at n=29A104221
• Number of compositions of n into odd and relatively prime parts.at n=28A108700
• a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4, with initial terms 0,1,3,3.at n=28A111573
• Alternating sum of the first n Fibonacci numbers.at n=30A119282
• a(2)=1. a(n) = the largest integer coprime to a(n-1) and less than the n-th Fibonacci number.at n=27A157605
• First differences of A160794.at n=53A160795
• Number of binary strings of length n with no substrings equal to 0001 0010 or 0110.at n=22A164447
• Number of binary strings of length n with no substrings equal to 0001 0100 or 0101.at n=22A164462
• Period of the decimal expansion of 1/F as F runs through the Fibonacci numbers greater than 1 and not divisible by 2 or 5.at n=13A175550