121390
domain: N
Appears in sequences
- a(n) = Fibonacci(n) - 3. Number of total preorders.at n=22A006327
- a(n) = Fibonacci(4n+2) - 3.at n=5A081075
- s(k)-s(j), where the pairs (k,j) are given by A205877 and A205878, and s(k) denotes the (k+1)-st Fibonacci number.at n=25A205879
- Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..7 array extended with zeros and convolved with 1,1,1.at n=24A222437
- 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=24A348591