login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060049 Triangulations of an n-gon such that each internal vertex has valence at least 6, i.e. nonpositively curved triangulations. 1
0, 1, 1, 2, 5, 15, 50, 181, 697, 2821, 11892, 51874, 232974, 1073070, 5053029, 24264565, 118570292, 588567257, 2963358162, 15114174106, 78004013763, 406971280545, 2144659072330, 11407141925639, 61197287846831 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

LINKS

Greg Kuperberg, Spiders for rank 2 Lie algebras, Comm. Math. Phys. 180 (1996), 109-151, arXiv:q-alg/9712003

FORMULA

The g.f. B(x) is derived from the g.f. A(x) of A059710 by A(x) = A(x*B(x))+1.

EXAMPLE

b(6) = 35 because there are 34 = A000108(4) triangulations without internal vertices, plus the triangulation with 6 pie slices.

CROSSREFS

A059710.

Sequence in context: A196836 A007853 A149952 * A107590 A148367 A192634

Adjacent sequences:  A060046 A060047 A060048 * A060050 A060051 A060052

KEYWORD

easy,nonn

AUTHOR

Greg Kuperberg (greg(AT)math.ucdavis.edu), Feb 15 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 12:38 EST 2012. Contains 206021 sequences.