%I #23 Feb 11 2015 11:14:19
%S 1,1,1,0,0,1,2,1,0,1,1,1,0,3,2,0,1,3,4,1,4,3,0,1,1,2,1,6,9,3,5,4,0,1,
%T 4,9,6,11,16,6,6,5,0,1,1,3,3,11,24,18,19,25,10,7,6,0,1,5,16,18,28,51,
%U 40,31,36,15,8,7,0,1,1,4,6,19,51,60,65,95,75,48,49,21,9,8,0,1
%N Number T(n,k) of compositions of n, where k is the difference between the number of odd parts and the number of even parts; triangle T(n,k), n>=0, -floor(n/2)+(n mod 2)<=k<=n, read by rows.
%C T(n,k) = T(n+k,-k).
%H Alois P. Heinz, <a href="/A242498/b242498.txt">Rows n = 0..120, flattened</a>
%e Triangle T(n,k) begins:
%e : n\k : -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7 8 9 10 ...
%e +-----+---------------------------------------------------------
%e : 0 : 1;
%e : 1 : 1;
%e : 2 : 1, 0, 0, 1;
%e : 3 : 2, 1, 0, 1;
%e : 4 : 1, 1, 0, 3, 2, 0, 1;
%e : 5 : 3, 4, 1, 4, 3, 0, 1;
%e : 6 : 1, 2, 1, 6, 9, 3, 5, 4, 0, 1;
%e : 7 : 4, 9, 6, 11, 16, 6, 6, 5, 0, 1;
%e : 8 : 1, 3, 3, 11, 24, 18, 19, 25, 10, 7, 6, 0, 1;
%e : 9 : 5, 16, 18, 28, 51, 40, 31, 36, 15, 8, 7, 0, 1;
%e : 10 : 1, 4, 6, 19, 51, 60, 65, 95, 75, 48, 49, 21, 9, 8, 0, 1;
%p b:= proc(n, i, p) option remember; `if`(n=0, p!, `if`(i<1, 0, expand(
%p add(x^(j*(2*irem(i, 2)-1))*b(n-i*j, i-1, p+j)/j!, j=0..n/i))))
%p end:
%p T:= n-> (p-> seq(coeff(p, x, i), i=ldegree(p)..degree(p)))(b(n$2, 0)):
%p seq(T(n), n=0..20);
%t b[n_, i_, p_] := b[n, i, p] = If[n == 0, p!, If[i<1, 0, Expand[Sum[x^(j*(2*Mod[i, 2]-1))*b[n-i*j, i-1, p+j]/j!, {j, 0, n/i}]]]] ; T[n_] := Function[{p}, Table[ Coefficient[p, x, i], {i, Exponent[p, x, Min], Exponent[p, x]}]][b[n, n, 0]]; Table[T[n], {n, 0, 20}] // Flatten (* _Jean-François Alcover_, Feb 11 2015, after _Alois P. Heinz_ *)
%Y Columns k=0-10 gives: A098123, A242499, A242500, A242501, A242502, A242503, A242504, A242505, A242506, A242507, A242508.
%Y Row sums give A011782.
%Y Diagonals include: A000012, A000004, A001477, A000217, A000290, A180415.
%Y Row lengths give A016777(floor(n/2)).
%Y Cf. A240009, A240021.
%K nonn,tabf
%O 0,7
%A _Alois P. Heinz_, May 16 2014