login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 3
4, 2, 8, 14, 54, 168 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..6.

Hugo Pfoertner, Chamber complex of 5 X 5 lattice polygon. Illustration.

Hugo Pfoertner, Chamber complex of 7 X 5 lattice polygon. Illustration.

Hugo Pfoertner, Chamber complex of 9 X 5 lattice polygon. Illustration.

EXAMPLE

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.

CROSSREFS

Cf. A288177, A288187.

Sequence in context: A002291 A225872 A231777 * A110622 A130078 A230900

Adjacent sequences:  A288178 A288179 A288180 * A288182 A288183 A288184

KEYWORD

nonn,tabl,more

AUTHOR

Hugo Pfoertner, Jun 06 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 17 15:32 EST 2020. Contains 331998 sequences. (Running on oeis4.)