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).
5, 6, 10, 25, 141, 2330, 273650, 599346021, 162615199748425, 97418273437938007563970, 15841633607002514292104722681296528726, 1543264591854508694059707631430587191184612139118583889182925
Offset: 0
Keywords
Links
- Amiram Eldar, Table of n, a(n) for n = 0..16
- Hideyuki Ohtsuka, Problem H-901, Advanced Problems and Solutions, The Fibonacci Quarterly, Vol. 60, No. 3 (2022), p. 281.
Programs
-
Mathematica
a[n_] := LucasL[2*Fibonacci[n]] + LucasL[2*Fibonacci[n + 1]]; Array[a, 12, 0]