a(n) = L(2*F(n)) + L(2*F(n+1)), where L(n) is the n-th Lucas number (A000032), and F(n) is the n-th Fibonacci number (A000045).
A356760
a(n) = L(2*F(n)) + L(2*F(n+1)), where L(n) is the n-th Lucas number (A000032), and F(n) is the n-th Fibonacci number (A000045).
Terms
- a(0) =5a(1) =6a(2) =10a(3) =25a(4) =141a(5) =2330a(6) =273650a(7) =599346021
External references
- oeis: A356760