A356761 a(n) = L(2*L(n)) + L(2*L(n+1)), where L(n) is the n-th Lucas number (A000032).
10, 21, 65, 890, 40446, 33424885, 1322190707485, 44140596372269298846, 58360810951947188228658239895890, 2576080923024092500207469693559464507701547824744865, 150342171745412969401059031474740559845525757221446054521410222913066501974929718621
Offset: 0
Keywords
Links
- Amiram Eldar, Table of n, a(n) for n = 0..15
- 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*LucasL[n]] + LucasL[2*LucasL[n + 1]]; Array[a, 11, 0]