OFFSET
5,1
LINKS
G. C. Greubel, Table of n, a(n) for n = 5..445
J. Riordan, Enumeration of trees by height and diameter, IBM J. Res. Dev. 4 (1960), 473-478.
FORMULA
a(n) = A034863(n), n > 6. - R. J. Mathar, Feb 26 2008
E.g.f.: x^5*(1 + 35*x + 35*x^2 - 59*x^3 + 12*x^5)/(24*(1-x)^4). - G. C. Greubel, Feb 16 2018
MAPLE
[5, 1170, seq(factorial(n)*(4*n^3-30*n^2+40*n+3)/24, n=7..22)]; # Muniru A Asiru, Feb 17 2018
MATHEMATICA
Join[{5, 1170}, Table[n!*(4*n^3-30*n^2+40*n+3)/24, {n, 7, 50}]] (* or *) Drop[With[{nn = 30}, CoefficientList[Series[(x^5*(1+35*x+35*x^2-59*x^3 + 12*x^5))/(24*(1-x)^4), {x, 0, nn}], x]*Range[0, nn]!], 5] (* G. C. Greubel, Feb 16 2018 *)
PROG
(PARI) x='x+O('x^30); Vec(serlaplace(x^5*(1+35*x+35*x^2-59*x^3 +12*x^5)/( 24*(1-x)^4))) \\ G. C. Greubel, Feb 16 2018
(Magma) [5, 1170] cat [Factorial(n)*(4*n^3-30*n^2+40*n+3)/24: n in [7..30]]; // G. C. Greubel, Feb 16 2018
(GAP) A034864:=Concatenation([5, 1170], List([7..22], n->Factorial(n)*(4*n^3-30*n^2+40*n+3)/24)); # Muniru A Asiru, Feb 17 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved