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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A296165 a(n) is the number of unimodular triangulations of [0,2]x[0,n]. 0

%I

%S 6,64,852,12170,182132,2801708,43936824

%N a(n) is the number of unimodular triangulations of [0,2]x[0,n].

%C As stated by Kaibel and Ziegler, the number of unimodular triangulations of [0,1]x[0,n] is (2n)!/(n!*n!). This gives a(1)=6.

%C No formula for a(n) is known. Aichholzer computed a(n) for n<=15.

%C Kaibel and Ziegler computed a(n) for n<=375. Aichholzer also computed the number of unimodular triangulations of [0,m]x[0,n] for m=3,4,5 and various n, and Kaibel-Ziegler extended these calculations to m=6.

%D V. Kaibel and G. Ziegler, "Counting lattice triangulations," London Math. Soc. Lecture Notes Series, Vol. 307, pp. 277-307, 2003.

%H O. Aichholzer, <a href="http://www.ist.tugraz.at/aichholzer/research/rp/triangulations/counting/">Counting Triangulations - Olympics</a>, 2006.

%H V. Kaibel and G. M. Ziegler, <a href="http://arXiv.org/abs/math.CO/0211268">Counting Lattice Triangulations</a>, arXiv:math/0211268 [math.CO], 2002.

%Y Second column of array A082640.

%K nonn,more

%O 1,1

%A _John Kieffer_, Dec 06 2017

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 December 1 22:12 EST 2021. Contains 349435 sequences. (Running on oeis4.)