28656

Appears in sequences

• a(n) = Fibonacci(n) - 1.at n=22A000071
• Moebius transform of Fibonacci numbers.at n=22A007436
• a(n) = Fibonacci(n) + (-1)^n.at n=23A008346
• Pisot sequence T(4,7).at n=18A020732
• a(n) = Fibonacci(2*n + 1) - 1.at n=11A027941
• a(n) = Fibonacci(n+2) - (1-(-1)^n)/2.at n=21A052952
• Third column of triangle A054450 (partial row sums of unsigned Chebyshev triangle A049310).at n=20A054451
• Numbers that are Fibonacci numbers plus or minus 1.at n=40A061489
• a(n) = phi(Fibonacci(n)).at n=23A065449
• a(n) = Fibonacci(n+1) - (1 + (-1)^n)/2.at n=22A074331
• a(n) = Fibonacci(n+1)+cos(n*Pi/2).at n=22A074662
• n for which there is a chain (or permutation) of the numbers from 1 to n for which each adjacent pair sums to a Fibonacci number.at n=40A079734
• a(n) = Fibonacci(4n+3) - 1, or Fibonacci(2n+2)*Lucas(2n+1).at n=5A081009
• A transform of the Pell numbers.at n=14A099516
• a(n) = Fibonacci(n) - (Fibonacci(n) mod 2).at n=23A104221
• Number of compositions of n into odd and relatively prime parts.at n=22A108700
• Alternating sum of the first n Fibonacci numbers.at n=24A119282
• a(n) = Fibonacci((prime(n)+3)/2) - 1.at n=12A121569
• a(n) = Fibonacci(n)*Lucas(n-1).at n=12A128534
• Number of possible palindromic rows (or columns) in an n X n crossword puzzle.at n=42A131524