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 A068096 #38 Jul 03 2023 05:13:50
%S A068096 1,1,2,3,13,89,2584,514229,2971215073,3416454622906707,
%T A068096 22698374052006863956975682,
%U A068096 173402521172797813159685037284371942044301,8801063578447437644962364569698707634360652047981718378070013667111
%N A068096 a(n) = F(L(n)) where F(n) = n-th Fibonacci number and L(n) = n-th Lucas number.
%H A068096 Vincenzo Librandi, <a href="/A068096/b068096.txt">Table of n, a(n) for n = 0..17</a>
%F A068096 a(n) = Sum_{k=1..F(n-1)+1} binomial(F(n-1), k-1)*F(F(n)+k-1), where F(n) is A000045. - _Tony Foster III_, Sep 03 2018
%t A068096 Table[Fibonacci[LucasL[n]], {n, 0, 13}] (* _Vladimir Joseph Stephan Orlovsky_, Feb 08 2012 *)
%o A068096 (Magma) [Fibonacci(Lucas(n)): n in [0..12]]; // _Vincenzo Librandi_, Sep 18 2017
%o A068096 (PARI) a(n) = fibonacci(fibonacci(n+1)+fibonacci(n-1)) \\ _Felix Fröhlich_, Sep 17 2017
%Y A068096 Cf. A000032, A000045, A005371.
%K A068096 easy,nonn
%O A068096 0,3
%A A068096 _Leroy Quet_, Mar 22 2002