A013655
a(n) = F(n+1) + L(n), where F(n) and L(n) are Fibonacci and Lucas numbers, respectively.
offset: 0
codomain: ℕ
Declarations
Section titled “Declarations”- A013655computable
a(n) = F(n+1) + L(n), where F(n) and L(n) are Fibonacci and Lucas numbers, respectively.