|
%I #27 Sep 08 2022 08:44:52
%S 0,60,720,7560,80640,907200,10886400,139708800,1916006400,28021593600,
%T 435891456000,7192209024000,125536739328000,2311968282624000,
%U 44816615940096000,912338253066240000,19463216065413120000,434273008459530240000,10116006549998469120000
%N a(n) = n!*(n-4)/2.
%H Vincenzo Librandi, <a href="/A034865/b034865.txt">Table of n, a(n) for n = 4..200</a>
%H J. Riordan, <a href="http://dx.doi.org/10.1147/rd.45.0473">Enumeration of trees by height and diameter</a>, IBM J. Res. Dev. 4 (1960), 473-478.
%H <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>
%F a(n) = 60 * A062199(n-5).
%F E.g.f.: x^5/(2*(1 - x)^2). - _Ilya Gutkovskiy_, May 23 2017
%t Table[n!*(n-4)/2,{n,4,30}] (* _Harvey P. Dale_, Apr 23 2012 *)
%o (Magma) [Factorial(n)*(n-4)/2: n in [4..22]]; // _Vincenzo Librandi_, May 25 2017
%o (PARI) x='x+O('x^30); concat([0], Vec(serlaplace(x^5/(2*(1-x)^2)))) \\ _G. C. Greubel_, Feb 16 2018
%K nonn
%O 4,2
%A _N. J. A. Sloane_
|
