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 A051578 #52 Nov 11 2024 22:41:52
%S A051578 1,6,48,480,5760,80640,1290240,23224320,464486400,10218700800,
%T A051578 245248819200,6376469299200,178541140377600,5356234211328000,
%U A051578 171399494762496000,5827582821924864000,209792981589295104000,7972133300393213952000,318885332015728558080000
%N A051578 a(n) = (2*n+4)!!/4!!, related to A000165 (even double factorials).
%C A051578 Row m=4 of the array A(3; m,n) := (2*n+m)!!/m!!, m >= 0, n >= 0.
%H A051578 G. C. Greubel, <a href="/A051578/b051578.txt">Table of n, a(n) for n = 0..400</a>
%H A051578 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=521">Encyclopedia of Combinatorial Structures 521</a>.
%H A051578 A. N. Stokes, <a href="https://doi.org/10.1017/S0004972700005219">Continued fraction solutions of the Riccati equation</a>, Bull. Austral. Math. Soc. Vol. 25 (1982), 207-214.
%F A051578 a(n) = (2*n+4)!!/4!!.
%F A051578 E.g.f.: 1/(1-2*x)^3.
%F A051578 a(n) ~ 2^(-1/2)*Pi^(1/2)*n^(5/2)*2^n*e^-n*n^n*{1 + 37/12*n^-1 + ...}. - Joe Keane (jgk(AT)jgk.org), Nov 23 2001
%F A051578 a(n) = (n+2)!*2^(n-1). - _Zerinvary Lajos_, Sep 23 2006. [corrected by _Gary Detlefs_, Apr 29 2019]
%F A051578 a(n) = 2^n*A001710(n+2). - _R. J. Mathar_, Feb 22 2008
%F A051578 From _Peter Bala_, May 26 2017: (Start)
%F A051578 a(n+1) = (2*n + 6)*a(n) with a(0) = 1.
%F A051578 O.g.f. satisfies the Riccati differential equation 2*x^2*A(x)' = (1 - 6*x)*A(x) - 1 with A(0) = 1.
%F A051578 G.f. as an S-fraction: A(x) = 1/(1 - 6*x/(1 - 2*x/(1 - 8*x/(1 - 4*x/(1 - 10*x/(1 - 6*x/(1 - ... - (2*n + 4)*x/(1 - 2*n*x/(1 - ...))))))))) (by Stokes 1982).
%F A051578 Reciprocal as an S-fraction: 1/A(x) = 1/(1 + 6*x/(1 - 8*x/(1 - 2*x/(1 - 10*x/(1 - 4*x/(1 - 12*x/(1 - 6*x/(1 - ... - (2*n + 6)*x/(1 - 2*n*x/(1 - ...)))))))))). (End)
%F A051578 From _Amiram Eldar_, Dec 11 2022: (Start)
%F A051578 Sum_{n>=0} 1/a(n) = 8*sqrt(e) - 12.
%F A051578 Sum_{n>=0} (-1)^n/a(n) = 8/sqrt(e) - 4. (End)
%F A051578 a(n) = A052587(n+2) for n > 0. - _M. F. Hasler_, Nov 10 2024
%p A051578 a:= proc(n) option remember; `if`(n=0, 1, 2*(n+2)*a(n-1)) end:
%p A051578 seq(a(n), n=0..20); # _Alois P. Heinz_, Apr 29 2019
%p A051578 seq(2^(n-1)*(n+2)!, n=0..20); # _G. C. Greubel_, Nov 11 2019
%t A051578 Table[2^(n-1)(n+2)!, {n,0,20}] (* _Jean-François Alcover_, Oct 05 2019 *)
%t A051578 Table[(2n+4)!!/8,{n,0,20}] (* _Harvey P. Dale_, Apr 06 2023 *)
%o A051578 (PARI) vector(21, n, 2^(n-2)*(n+1)! ) \\ _G. C. Greubel_, Nov 11 2019
%o A051578 (PARI) apply( {A051578(n)=(n+2)!<<(n-1)}, [0..18]) \\ _M. F. Hasler_, Nov 10 2024
%o A051578 (Magma) [2^(n-1)*Factorial(n+2): n in [0..20]]; // _G. C. Greubel_, Nov 11 2019
%o A051578 (Sage) [2^(n-1)*factorial(n+2) for n in (0..20)] # _G. C. Greubel_, Nov 11 2019
%o A051578 (GAP) List([0..20], n-> 2^(n-1)*Factorial(n+2) ); # _G. C. Greubel_, Nov 11 2019
%Y A051578 Cf. A000165, A001147(n+1), A002866(n+1), A051577 (rows m=0..3), A051579, A051580, A051581, A051582, A051583.
%Y A051578 Cf. A052587 (essentially the same).
%K A051578 easy,nonn
%O A051578 0,2
%A A051578 _Wolfdieter Lang_