832041

Appears in sequences

• a(n) = Fibonacci(n) + 1.at n=30A001611
• a(n) = Fibonacci(n) + (-1)^n.at n=30A008346
• Pisot sequences L(4,6), E(4,6).at n=26A020706
• Pisot sequences L(6,9), E(6,9).at n=25A020717
• Pisot sequence L(3,4).at n=27A048577
• Expansion of (2-6*x+4*x^2-x^3)/((1-x)*(1-3*x+x^2)).at n=15A052925
• a(n) = 3*a(n-1) - a(n-2) - 1 with a(0) = 1 and a(1) = 2.at n=15A055588
• a(n) = Fibonacci(4n+2) + 1, or Fibonacci(2n+2)*Lucas(2n).at n=7A081004
• a(n) = 1 + Fibonacci(n) - (Fibonacci(n) mod 2).at n=30A104220
• Smallest nonsquarefree integer > the n-th term of the Fibonacci sequence.at n=29A114555
• a(n) = F(n+1) + (1-(-1)^n)/2, where F() = Fibonacci numbers A000045.at n=29A127968
• a(n) = F(n)*L(n-2) where F = Fibonacci and L = Lucas numbers.at n=16A128535
• a(2n) = A000045(6n) + 1, a(2n+1) = A000045(6n+3) - 1.at n=10A140413
• a(n) = A000045(n) + A131531(n+3).at n=30A141325
• Index of 1/n in the Fibonacci (or rabbit) ordering of the positive rationals.at n=27A226271
• a(n) = F(floor( (n+3)/2 )) * L(floor( (n+2)/2 )) where F=Fibonacci and L=Lucas numbers.at n=29A236144
• G.f.: Sum_{n>=1} Fibonacci(n+1) * x^n / (1 - x^n).at n=28A245282
• a(n) = a(n-1) + a(n-2) - a(n-3) + a(n-4) + a(n-5), with a(0)=a(1)=a(2)=1, a(3)=-1 and a(4)=1.at n=32A290968
• 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=30A298920
• 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=27A301791