5702888

Appears in sequences

• a(n) = Fibonacci(n) + 1.at n=34A001611
• a(n) = Fibonacci(n) + (-1)^n.at n=34A008346
• a(n+1) = a(n) - F(n) if > 0, otherwise a(n) + F(n), where F() are Fibonacci numbers; a(0) = 0.at n=34A011369
• Pisot sequences L(4,6), E(4,6).at n=30A020706
• Pisot sequences L(6,9), E(6,9).at n=29A020717
• Pisot sequence L(3,4).at n=31A048577
• Sum_{i=0..2n} (C(2n,i) mod 2)*Fibonacci(i+2) = Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2i+2).at n=16A048757
• Expansion of (2-6*x+4*x^2-x^3)/((1-x)*(1-3*x+x^2)).at n=17A052925
• a(n) = 3*a(n-1) - a(n-2) - 1 with a(0) = 1 and a(1) = 2.at n=17A055588
• a(n) = Fibonacci(4n+2) + 1, or Fibonacci(2n+2)*Lucas(2n).at n=8A081004
• Smallest nonsquarefree integer > the n-th term of the Fibonacci sequence.at n=33A114555
• a(n) = F(n+1) + (1-(-1)^n)/2, where F() = Fibonacci numbers A000045.at n=33A127968
• a(n) = F(n)*L(n-2) where F = Fibonacci and L = Lucas numbers.at n=18A128535
• Index of 1/n in the Fibonacci (or rabbit) ordering of the positive rationals.at n=31A226271
• a(n) = F(floor( (n+3)/2 )) * L(floor( (n+2)/2 )) where F=Fibonacci and L=Lucas numbers.at n=33A236144
• Number of 5 X n 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,0) or (-1,-1) and new values introduced in order 0..2.at n=9A275505
• 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=31A301791
• a(n) = (-1)^n * A000045(n) + 1.at n=34A355020