%I A121552
%S A121552 1,0,2,0,0,4,2,0,0,0,8,8,6,2,0,0,0,0,16,24,28,26,16,8,2,0,0,0,0,0,32,64,
%T A121552 96,120,126,110,82,52,26,10,2,0,0,0,0,0,0,64,160,288,432,564,658,680,
%U A121552 638,542,416,284,172,90,38,12,2,0,0,0,0,0,0,0,128,384,800,1376,2072
%N A121552 Triangle read by rows: T(n,k) is the number of deco polyominoes of height 
               n and area k (n>=1, k>=1). A deco polyomino is a directed column-convex 
               polyomino in which the height, measured along the diagonal, is attained 
               only in the last column.
%C A121552 Row n has 1+n(n-1)/2 terms, the first n-1 being 0's. Row sums are the 
               factorials (A000142). T(n,n)=2^(n-1). Sum(k*T(n,k), k=1..1+n(n-1)/
               2)=A121553(n).
%D A121552 E. Barcucci, A. del Lungo and R. Pinzani, "Deco" polyominoes, permutations 
               and random generation, Theoretical Computer Science, 159, 1996, 29-42.
%F A121552 The row generating polynomials are P(1,t)=t and P(n,t)=2t^n*product(2+t+t^2+...+t^j, 
               j=1..n-2) for n>=2.
%e A121552 Triangle starts:
%e A121552 1;
%e A121552 0,2;
%e A121552 0,0,4,2;
%e A121552 0,0,0,8,8,6,2;
%e A121552 0,0,0,0,16,24,28,26,16,8,2;
%p A121552 for n from 1 to 8 do P[n]:=sort(expand(simplify(2*t^n*product(2+sum(t^i,
               i=1..j),j=1..n-2)))) od: for n from 1 to 8 do seq(coeff(P[n],t,j),
               j=1..n*(n-1)/2+1) od; # yields sequence in triangular form
%Y A121552 Cf. A000142, A121553.
%Y A121552 Sequence in context: A155039 A106235 A118965 this_sequence A158118 A147592 
               A108885
%Y A121552 Adjacent sequences: A121549 A121550 A121551 this_sequence A121553 A121554 
               A121555
%K A121552 nonn,tabf
%O A121552 1,3
%A A121552 Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 08 2006