This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A356760 #13 Jan 05 2025 19:51:42
%S A356760 5,6,10,25,141,2330,273650,599346021,162615199748425,
%T A356760 97418273437938007563970,15841633607002514292104722681296528726,
%U A356760 1543264591854508694059707631430587191184612139118583889182925
%N 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).
%H A356760 Amiram Eldar, <a href="/A356760/b356760.txt">Table of n, a(n) for n = 0..16</a>
%H A356760 Hideyuki Ohtsuka, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Problems/AdvProbAug2022.pdf">Problem H-901</a>, Advanced Problems and Solutions, The Fibonacci Quarterly, Vol. 60, No. 3 (2022), p. 281.
%F A356760 a(n) = A000032(2*A000045(n)) + A000032(2*A000045(n+1)).
%F A356760 a(n) = A316275(n) + A316275(n+1).
%F A356760 Sum_{n>=0} (-1)^n/a(n) = 1/10 (Ohtsuka, 2022).
%t A356760 a[n_] := LucasL[2*Fibonacci[n]] + LucasL[2*Fibonacci[n + 1]]; Array[a, 12, 0]
%Y A356760 Cf. A000032, A000045, A316275, A356761.
%K A356760 nonn
%O A356760 0,1
%A A356760 _Amiram Eldar_, Aug 26 2022