OFFSET
0,3
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..350
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 679
FORMULA
D-finite with recurrence: a(0) = a(1) = 0, a(2) = 2, a(3) = 6, a(4) = 24, (n+4)*a(n+3) = (15 + 11*n + 2*n^2)*a(n+2) - (6 + 11*n + 6*n^2 + n^3)*a(n+1) - (12 - 2*n - 32*n^2 - 22*n^2 - 4*n^4)*a(n).
a(n) = n!*A023431(n-2). - R. J. Mathar, Oct 18 2013
MAPLE
spec := [S, {B=Prod(S, S), C=Union(B, S, Z), S=Prod(Z, C)}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
seq(n!*add(binomial(n-2-k, 2*k)*binomial(2*k, k)/(k+1), k=0..floor((n-2)/3)), n=0..18); # Mark van Hoeij, May 12 2013
MATHEMATICA
With[{nn=20}, CoefficientList[Series[(1-x-Sqrt[1-2x+x^2-4x^3])/(2x), {x, 0, nn}], x] Range[0, nn]!] (* Harvey P. Dale, Jan 19 2017 *)
a[n_]:= a[n]= n!*Sum[Binomial[n-k-2, 2*k]*CatalanNumber[k], {k, 0, Floor[(n-2)/2]}];
Table[a[n], {n, 0, 30}] (* G. C. Greubel, May 28 2022 *)
PROG
(SageMath)
def A052723(n): return factorial(n)*sum( binomial(n-k-2, 2*k)*catalan_number(k) for k in (0..(n-2)//2) )
[A052723(n) for n in (0..30)] # G. C. Greubel, May 28 2022
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
INRIA Encyclopedia of Combinatorial Structures, Jan 25 2000
STATUS
approved
