14930349
domain: N
Appears in sequences
- a(n) = Fibonacci(n) - 3. Number of total preorders.at n=32A006327
- a(n) = Fibonacci(4n)-3, or Fibonacci(2n-2)*Lucas(2n+2).at n=8A081074
- a(2)=1. a(n) = the largest integer coprime to a(n-1) and less than the n-th Fibonacci number.at n=34A157605
- a(n) = L(n)*L(n+1) mod F(n+2) where F=A000045 is the Fibonacci numbers and L = A000032 is the Lucas numbers.at n=34A348591