OFFSET
1,2
REFERENCES
E. Barcucci, A. Del Lungo and R. Pinzani, "Deco" polyominoes, permutations and random generation, Theoretical Computer Science, 159, 1996, 29-42.
FORMULA
a(1)=1, a(2)=4, a(n)=[(2n-3)a(n-1)-(n-1)a(n-2)]/(n-2) + (1/2)(2n^3-9n^2+17n-16)(n-1)!/(n-2) for n>=3.
Conjecture D-finite with recurrence 14*(-n+1)*a(n) +(14*n^2+1731*n-6995)*a(n-1) +3*(-577*n^2+480*n+7243)*a(n-2) +2*(2781*n^2-11952*n+6004)*a(n-3) +(-5987*n^2+36181*n-54220)*a(n-4) +2*(1071*n-3433)*(n-4)*a(n-5)=0. - R. J. Mathar, Jul 26 2022
EXAMPLE
a(2)=4 because the deco polyominoes of height 2 are the vertical and horizontal dominoes, each having a total of 2 cells in their first two columns.
MAPLE
a[1]:=1: a[2]:=4: for n from 3 to 22 do a[n]:=((2*n-3)*a[n-1]-(n-1)*a[n-2])/(n-2)+(1/2)*(2*n^3-9*n^2+17*n-16)*(n-1)!/(n-2) od: seq(a[n], n=1..22);
CROSSREFS
KEYWORD
nonn
AUTHOR
Emeric Deutsch, Aug 11 2006
STATUS
approved