OFFSET
1,3
COMMENTS
a(n) = Sum_{k=0..n-1} k*A134436(n,k).
REFERENCES
E. Barcucci, A. del Lungo and R. Pinzani, "Deco" polyominoes, permutations and random generation, Theoretical Computer Science, 159, 1996, 29-42.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..400
FORMULA
a(n) = (1/4)*(3n-2)*(n-1)*(n-1)!.
a(n) = (1/2)*(3n-4)*(n-1)! + (n-1)*a(n-1); a(1)=0.
a(n) = (n+2)!*Sum_{k=1..n} ((2*k-1)/(k*(k+1)*(k+2))). - Gary Detlefs, Sep 20 2011
D-finite with recurrence +3*a(n) +(-3*n-11)*a(n-1) +2*(4*n-3)*a(n-2) +2*(-n+3)*a(n-3)=0. - R. J. Mathar, Jul 26 2022
EXAMPLE
a(2)=1 because the horizontal domino has no cells in the 2nd row and the vertical domino has 1 cell in the 2nd row.
MAPLE
seq((1/4)*(3*n-2)*(n-1)*factorial(n-1), n = 1 .. 18)
MATHEMATICA
Table[((3n-2)(n-1)(n-1)!)/4, {n, 20}] (* Harvey P. Dale, Sep 23 2011 *)
PROG
(Magma)[(3*n-2)*(n-1)*Factorial(n-1)/4: n in [1..20]]; // Vincenzo Librandi, Sep 24 2011
CROSSREFS
KEYWORD
nonn
AUTHOR
Emeric Deutsch, Nov 30 2007
STATUS
approved