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 A005922 M4207 #27 Jan 05 2025 19:51:33
%S A005922 1,6,30,192,1560,15120,171360,2217600,32296320,522547200,9300614400,
%T A005922 180583603200,3798482688000,86044973414400,2088355965696000,
%U A005922 54064489070592000,1487129136869376000,43312058119249920000
%N A005922 a(1)=1; a(n) = n!*Fibonacci(n+2), n > 1.
%C A005922 From solution to a difference equation.
%D A005922 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A005922 Vincenzo Librandi, <a href="/A005922/b005922.txt">Table of n, a(n) for n = 1..200</a>
%H A005922 P. R. J. Asveld & N. J. A. Sloane, <a href="/A005442/a005442.pdf">Correspondence, 1987</a>
%H A005922 P. R. J. Asveld, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/25-4/asveld.pdf">Another family of Fibonacci-like sequences</a>, Fib. Quart., 25 (1987), 361-364.
%t A005922 Join[{1},Table[n!Fibonacci[n+2],{n,2,20}]] (* _Harvey P. Dale_, May 26 2024 *)
%o A005922 (Magma) [1] cat [Factorial(n)*Fibonacci(n+2): n in [2..20]]; // _Vincenzo Librandi_, Jul 10 2012
%o A005922 (PARI) a(n)=if(n>1, n!*fibonacci(n+2), 1) \\ _Charles R Greathouse IV_, Jun 30 2017
%Y A005922 Cf. A005921, A078700.
%K A005922 nonn,easy
%O A005922 1,2
%A A005922 _N. J. A. Sloane_
%E A005922 More terms and better description from _Vladeta Jovovic_, Jan 23 2005