|
%I #16 Oct 02 2017 21:28:42
%S 1,0,4,0,1,8,0,0,6,12,0,0,1,18,16,0,0,0,8,38,20,0,0,0,1,32,66,24,0,0,
%T 0,0,10,88,102,28,0,0,0,0,1,50,192,146,32,0,0,0,0,0,12,170,360,198,36,
%U 0,0,0,0,0,1,72,450,608,258,40,0,0,0,0,0,0,14,292,1002,952,326,44,0,0,0
%N Triangle T(n,k) giving number of fixed 2 X k polyominoes with n cells (n >= 2, 1<=k<=n-1).
%H Andrew Howroyd, <a href="/A059678/b059678.txt">Table of n, a(n) for n = 2..1276</a>
%H R. C. Read, <a href="http://cms.math.ca/cjm/v14/cjm1962v14.0001-0020.pdf">Contributions to the cell growth problem</a>, Canad. J. Math., 14 (1962), 1-20.
%F T(n, k) = Sum_v C(n-k+1, 2*k-n-v)*C(n-k+v, n-k).
%F G.f. (1+x*y)^2/(1-x*y)*1/((1-x*y)-(1+x*y)*x^2*y). - Christopher Hanusa (chanusa(AT)math.washington.edu), Sep 22 2004
%F T(n,k) = 0 for n > 2*k. - _Andrew Howroyd_, Oct 02 2017
%e Triangle begins:
%e 1;
%e 0, 4;
%e 0, 1, 8;
%e 0, 0, 6, 12;
%e 0, 0, 1, 18, 16;
%e 0, 0, 0, 8, 38, 20;
%e 0, 0, 0, 1, 32, 66, 24;
%e ...
%p with(combinat): for n from 2 to 30 do for k from 1 to n-1 do printf(`%d,`,sum(binomial(n-k+1, 2*k-n-v)*binomial(n-k+v, n-k), v=0..k) ) od:od:
%t t[n_, k_] := Sum[Binomial[n-k+1, 2*k-n-v]*Binomial[n-k+v, n-k], {v, 0, k}]; Table[t[n, k], {n, 2, 15}, {k, 1, n-1}] // Flatten (* _Jean-François Alcover_, Dec 20 2013 *)
%Y Column sums are A034182.
%Y Cf. A059679, A059680, A059681, A059682.
%K nonn,easy,nice,tabl
%O 2,3
%A _N. J. A. Sloane_, Feb 05 2001
%E More terms from _James A. Sellers_, Feb 06 2001
|
