121392

Appears in sequences

• a(n) = Fibonacci(n) - 1.at n=25A000071
• Fibonacci(n) - (-1)^n.at n=25A007492
• Pisot sequence T(4,7).at n=21A020732
• Duplicate of A035508.at n=12A027418
• a(n) = Fibonacci(2*n+2) - 1.at n=12A035508
• Numbers that are Fibonacci numbers plus or minus 1.at n=46A061489
• 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=46A079734
• a(n) = Fibonacci(4n+2) - 1, or Fibonacci(2n)*Lucas(2n+2).at n=6A081008
• a(n) = Fibonacci(n) - (Fibonacci(n) mod 2).at n=26A104221
• Number of compositions of n into odd and relatively prime parts.at n=25A108700
• a(n) = a(n-1) + a(n-3) + a(n-4).at n=25A115008
• a(n) = F(n)*L(n+2) where F=Fibonacci and L=Lucas numbers.at n=12A128533
• Number of possible palindromic rows (or columns) in an n X n crossword puzzle.at n=48A131524
• Number of possible palindromic rows (or columns) in an n X n crossword puzzle.at n=49A131524
• a(0)=1; for n >= 1, a(n) = ceiling(Fibonacci(n)/a(n-1)).at n=49A140829
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, 1, 1), (1, 0, -1), (1, 0, 0)}.at n=9A150245
• First differences of A160794.at n=47A160795
• Fibonacci-accumulation sequence.at n=47A163227
• Expansion of 1/((1-x)*(1-x^2-x^4)) + x/(1-3*x^3).at n=47A169592
• Numbers that have 12 terms in their Zeckendorf representation.at n=12A179252