121394

Appears in sequences

• a(n) = Fibonacci(n) + 1.at n=26A001611
• a(n) = Fibonacci(n) + (-1)^n.at n=26A008346
• a(n+1) = a(n) - F(n) if > 0, otherwise a(n) + F(n), where F() are Fibonacci numbers; a(0) = 0.at n=27A011369
• Pisot sequences L(4,6), E(4,6).at n=22A020706
• Pisot sequences L(6,9), E(6,9).at n=21A020717
• Pisot sequence L(3,4).at n=23A048577
• Expansion of (2-6*x+4*x^2-x^3)/((1-x)*(1-3*x+x^2)).at n=13A052925
• a(n) = 3*a(n-1) - a(n-2) - 1 with a(0) = 1 and a(1) = 2.at n=13A055588
• Numbers that are Fibonacci numbers plus or minus 1.at n=47A061489
• a(n) = Fibonacci(4n+2) + 1, or Fibonacci(2n+2)*Lucas(2n).at n=6A081004
• Smallest squarefree integer > the n-th term of the Fibonacci sequence.at n=26A111077
• a(n) = F(n+1) + (1-(-1)^n)/2, where F() = Fibonacci numbers A000045.at n=25A127968
• a(n) = F(n)*L(n-2) where F = Fibonacci and L = Lucas numbers.at n=14A128535
• Number of (w,x,y,z) with all terms in {1,...,n} and w>2x and y<=3z.at n=28A212517
• Index of 1/n in the Fibonacci (or rabbit) ordering of the positive rationals.at n=23A226271
• Fibonacci shuffles: a(2n) = A000071(n) and a(2n+1) = A001611(n+2).at n=49A226649
• a(n) = F(floor( (n+3)/2 )) * L(floor( (n+2)/2 )) where F=Fibonacci and L=Lucas numbers.at n=25A236144
• Strictly increasing list of F and F + 1, where F = A000045, the Fibonacci numbers.at n=47A259623
• Number of n X 4 0..1 arrays with every element equal to 1, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=26A298920
• Number of 2Xn 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=23A301791