login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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]. 1
6, 64, 852, 12170, 182132, 2801708, 43936824 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
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.
No formula for a(n) is known. Aichholzer computed a(n) for n<=15.
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.
REFERENCES
V. Kaibel and G. Ziegler, "Counting lattice triangulations," London Math. Soc. Lecture Notes Series, Vol. 307, pp. 277-307, 2003.
LINKS
V. Kaibel and G. M. Ziegler, Counting Lattice Triangulations, arXiv:math/0211268 [math.CO], 2002.
CROSSREFS
Second column of array A082640.
Sequence in context: A156887 A239847 A264634 * A173500 A141008 A336114
KEYWORD
nonn,more
AUTHOR
John Kieffer, Dec 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 18 22:56 EDT 2024. Contains 370952 sequences. (Running on oeis4.)