This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A288181 #13 Jun 08 2017 18:48:42 %S A288181 4,2,8,14,54,168 %N A288181 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 A288181 Hugo Pfoertner, <a href="/A288181/a288181.pdf">Chamber complex of 5 X 5 lattice polygon.</a> Illustration. %H A288181 Hugo Pfoertner, <a href="/A288181/a288181_1.pdf">Chamber complex of 7 X 5 lattice polygon.</a> Illustration. %H A288181 Hugo Pfoertner, <a href="/A288181/a288181_2.pdf">Chamber complex of 9 X 5 lattice polygon.</a> Illustration. %e A288181 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 A288181 Cf. A288177, A288187. %K A288181 nonn,tabl,more %O A288181 1,1 %A A288181 _Hugo Pfoertner_, Jun 06 2017