46369

Appears in sequences

• a(n) = Fibonacci(n) + 1.at n=24A001611
• a(n) = Fibonacci(n) + (-1)^n.at n=24A008346
• Pisot sequences L(4,6), E(4,6).at n=20A020706
• Pisot sequences L(6,9), E(6,9).at n=19A020717
• a(n) = 2*A040027(n-1) + Bell(n), where Bell = A000110.at n=9A038559
• Row 3 of square array defined in A047671.at n=28A047672
• Pisot sequence L(3,4).at n=21A048577
• Expansion of (2-6*x+4*x^2-x^3)/((1-x)*(1-3*x+x^2)).at n=12A052925
• a(n) = 3*a(n-1) - a(n-2) - 1 with a(0) = 1 and a(1) = 2.at n=12A055588
• Numbers that are Fibonacci numbers plus or minus 1.at n=43A061489
• a(n) = Fibonacci(4n) + 1, or Fibonacci(2n-1)*Lucas(2n+1).at n=6A081002
• a(n) = 1 + Fibonacci(n) - (Fibonacci(n) mod 2).at n=24A104220
• Smallest squarefree integer > the n-th term of the Fibonacci sequence.at n=24A111077
• a(n) = a(n-1) + a(n-3) + a(n-4).at n=23A115008
• 288*n^2 - 168*n - 119.at n=12A118059
• a(n) = F(n+1) + (1-(-1)^n)/2, where F() = Fibonacci numbers A000045.at n=23A127968
• a(n) = F(n)*L(n+2) where F=Fibonacci and L=Lucas numbers.at n=11A128533
• a(2n) = A000045(6n) + 1, a(2n+1) = A000045(6n+3) - 1.at n=8A140413
• a(n) = A000045(n) + A131531(n+3).at n=24A141325
• First differences of A116697.at n=22A186679