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 A051294 #37 May 08 2025 03:52:42
%S A051294 1,3,17,329,15005,1866294,598364773,505248088463,1114384187445409,
%T A051294 6440451785077489365,97415813466381445596089,
%U A051294 3858093084890921488916776332,400009475456580321242184872389193,108580324845164033411588204172311746011,77162132055850720265395402022419687035969985
%N A051294 a(n) = F(n^2)/F(n), where F(n) = A000045(n) is the n-th Fibonacci number.
%H A051294 Clark Kimberling, <a href="/A051294/b051294.txt">Table of n, a(n) for n = 1..69</a> (all terms with <= 1000 digits)
%F A051294 a(n) = [x^(n-1)] 1/(1 - Lucas(n)*x + (-1)^n*x^2), where Lucas(n) = A000204(n). - _Paul D. Hanna_, Jan 28 2012
%p A051294 a:= n-> (f->f(n^2)/f(n))(k->(<<0|1>, <1|1>>^k)[1, 2]):
%p A051294 seq(a(n), n=1..15); # _Alois P. Heinz_, May 08 2025
%t A051294 Table[Fibonacci[n^2]/Fibonacci[n],{n,15}] (* _Harvey P. Dale_, Apr 12 2011 *)
%o A051294 (PARI) a(n)=fibonacci(n^2)/fibonacci(n)
%o A051294 (PARI) {Lucas(n)=fibonacci(n-1)+fibonacci(n+1)}
%o A051294 {a(n)=polcoeff(1/(1-Lucas(n)*x+(-1)^n*x^2+x*O(x^n)),n-1)} /* _Paul D. Hanna_, Jan 28 2012 */
%Y A051294 Main diagonal of array A028412.
%K A051294 nonn,easy
%O A051294 1,2
%A A051294 _Leroy Quet_
%E A051294 More terms from _Benoit Cloitre_, Jan 05 2003