2178310

Appears in sequences

• a(n) = Fibonacci(n) + 1.at n=32A001611
• a(n) = Fibonacci(n) + (-1)^n.at n=32A008346
• a(n+1) = a(n) - F(n) if > 0, otherwise a(n) + F(n), where F() are Fibonacci numbers; a(0) = 0.at n=33A011369
• Pisot sequences L(4,6), E(4,6).at n=28A020706
• Pisot sequences L(6,9), E(6,9).at n=27A020717
• Pisot sequence L(3,4).at n=29A048577
• Expansion of (2-6*x+4*x^2-x^3)/((1-x)*(1-3*x+x^2)).at n=16A052925
• a(n) = 3*a(n-1) - a(n-2) - 1 with a(0) = 1 and a(1) = 2.at n=16A055588
• a(n) = Fibonacci(4n) + 1, or Fibonacci(2n-1)*Lucas(2n+1).at n=8A081002
• Smallest squarefree integer > the n-th term of the Fibonacci sequence.at n=32A111077
• a(n) = a(n-1) + a(n-3) + a(n-4).at n=31A115008
• a(n) = F(n+1) + (1-(-1)^n)/2, where F() = Fibonacci numbers A000045.at n=31A127968
• a(n) = F(n)*L(n+2) where F=Fibonacci and L=Lucas numbers.at n=15A128533
• a(0)=1. a(n) = the smallest integer coprime to a(n-1) and greater than the n-th Fibonacci number.at n=32A157420
• First differences of A116697.at n=30A186679
• Index of 1/n in the Fibonacci (or rabbit) ordering of the positive rationals.at n=29A226271
• G.f.: Sum_{n>=1} Fibonacci(n+1) * x^n / (1 - x^n).at n=30A245282
• 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=32A298920
• 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=29A301791
• a(n) = (-1)^n * A000045(n) + 1.at n=32A355020