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 A259451 #31 Mar 06 2023 02:59:21
%S A259451 0,1,4,18,48,125,288,637,1344,2754,5500,10769,20736,39377,73892,
%T A259451 137250,252672,461533,837216,1509341,2706000,4827186,8572124,15159553,
%U A259451 26707968,46890625,82061668,143188722,249163824,432466589,748836000,1293764509,2230588416,3838265442,6592537372,11303644625,19349736192
%N A259451 a(n) = n^2*Fibonacci(n).
%H A259451 Colin Barker, <a href="/A259451/b259451.txt">Table of n, a(n) for n = 0..1000</a>
%H A259451 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (3,0,-5,0,3,1).
%F A259451 From _Colin Barker_, Jun 29 2015: (Start)
%F A259451 a(n) = 3*a(n-1) - 5*a(n-3) + 3*a(n-5) + a(n-6).
%F A259451 G.f.: -x*(x^4 - x^3 + 6*x^2 + x + 1)/(x^2 + x - 1)^3. (End)
%F A259451 E.g.f.: exp(x/2)*x*(sqrt(5)*(1 + x)*cosh(sqrt(5)*x/2) + (1 + 3*x)*sinh(sqrt(5)*x/2))/sqrt(5). - _Stefano Spezia_, Mar 04 2023
%p A259451 a:= n-> n^2*(<<1|1>, <1|0>>^n)[1, 2]:
%p A259451 seq(a(n), n=0..50); # _Alois P. Heinz_, Jun 30 2015
%t A259451 a[n_] := n^2 MatrixPower[{{1, 1}, {1, 0}}, n][[1, 2]]; Table[a[n], {n, 0, 50}] (* _Jean-François Alcover_, Feb 14 2016, after _Alois P. Heinz_ *)
%o A259451 (PARI) concat(0, Vec(-x*(x^4-x^3+6*x^2+x+1)/(x^2+x-1)^3 + O(x^100))) \\ _Colin Barker_, Jun 29 2015
%Y A259451 Cf. A000045, A000290, A169630.
%K A259451 nonn,easy
%O A259451 0,3
%A A259451 _N. J. A. Sloane_, Jun 27 2015