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 A052585 #23 Sep 08 2022 08:44:59
%S A052585 1,1,6,30,264,2520,30960,428400,6894720,123742080,2478470400,
%T A052585 54486432000,1308153369600,34005760588800,952248474777600,
%U A052585 28566146568960000,914137612996608000,31080323154456576000,1118898035934142464000,42518003720397004800000
%N A052585 E.g.f. 1/(1-x-2*x^2).
%C A052585 Laguerre transform is A052563. - _Paul Barry_, Aug 08 2008
%H A052585 G. C. Greubel, <a href="/A052585/b052585.txt">Table of n, a(n) for n = 0..350</a>
%H A052585 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=530">Encyclopedia of Combinatorial Structures 530</a>
%F A052585 E.g.f.: 1/(1 -x -2*x^2).
%F A052585 Recurrence: a(1)=1, a(0)=1, (-2*n^2-6*n-4)*a(n)+(-2-n)*a(n+1)+a(n+2)=0.
%F A052585 a(n) = Sum(1/9*(1+4*_alpha)*_alpha^(-1-n), _alpha=RootOf(-1+_Z+2*_Z^2))*n!.
%F A052585 a(n) = n!*A001045(n+1). - _Paul Barry_, Aug 08 2008
%F A052585 a(n) = D^n(1/(1-x)) evaluated at x = 0, where D is the operator sqrt(1+8*x)*d/dx. Cf. A080599 and A005442. - Peter Bala, Dec 07 2011
%p A052585 spec := [S,{S=Sequence(Union(Z,Prod(Z,Union(Z,Z))))},labeled]: seq(combstruct[count](spec,size=n), n=0..20);
%t A052585 With[{m = 50}, CoefficientList[Series[-1/(-1 + x + 2*x^2), {x, 0, m}], x]*Range[0, m]!] (* _G. C. Greubel_, May 17 2018 *)
%o A052585 (PARI) x='x+O('x^30); Vec(serlaplace(1/(1 -x -2*x^2))) \\ _G. C. Greubel_, May 17 2018
%o A052585 (Magma) m:=25; R<x>:=PowerSeriesRing(Rationals(), m); b:=Coefficients(R!(1/(1 -x -2*x^2))); [Factorial(n-1)*b[n]: n in [1..m]]; // _G. C. Greubel_, May 17 2018
%Y A052585 Cf. A080599, A005442.
%K A052585 easy,nonn
%O A052585 0,3
%A A052585 encyclopedia(AT)pommard.inria.fr, Jan 25 2000
%E A052585 a(18)-a(19) added by _G. C. Greubel_, May 17 2018