%I #13 Jun 08 2017 18:48:42
%S 4,2,8,14,54,168
%N Occurrence counts of chambers with maximum number of vertices in the chamber complex of an n X m lattice polygon as described in A288177, written as triangle T(n,m), n >= 1, 1 <= m <= n.
%H Hugo Pfoertner, <a href="/A288181/a288181.pdf">Chamber complex of 5 X 5 lattice polygon.</a> Illustration.
%H Hugo Pfoertner, <a href="/A288181/a288181_1.pdf">Chamber complex of 7 X 5 lattice polygon.</a> Illustration.
%H Hugo Pfoertner, <a href="/A288181/a288181_2.pdf">Chamber complex of 9 X 5 lattice polygon.</a> Illustration.
%e The chamber complex of the 5 X 5 lattice polygon has 16 chambers of size 6, so T(5,5)=16, taken from illustration on Pfetsch and Ziegler web page, see link in A288177.
%Y Cf. A288177, A288187.
%K nonn,tabl,more
%O 1,1
%A _Hugo Pfoertner_, Jun 06 2017