Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060050
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060050 Number of irreducible nonpositively curved triangulations of an n-gon: All internal vertices have at valence at least 6 and no diagonals of the n-gon are allowed. +0
1
0, 1, 0, 0, 1, 1, 5, 13, 46, 155, 561, 2068, 7871, 30586, 121391, 490196, 2011422, 8370698, 35285987, 150485667, 648653910, 2823402675, 12400659846, 54920758496, 245126368841, 1101983749921, 4987538210079, 22716326086134 (list; graph; listen)
OFFSET

2,7

LINKS

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

FORMULA

The g.f. C(x) is derived from the g.f. B(x) of A060049 by B_1(x) = C_1(B_1(x))+x, where B_1(x) = B(x)/x and C_1(x) = C(x)/x.

EXAMPLE

c(8) = 5 = 1+4. We can divide the octagon into 8 pie slices and we can split any pair of opposite radii of this triangulation into two triangles.

CROSSREFS

A060049, A059710.

Sequence in context: A147200 A147396 A099972 this_sequence A152925 A120790 A162563

Adjacent sequences: A060047 A060048 A060049 this_sequence A060051 A060052 A060053

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 19:39 EST 2009. Contains 170821 sequences.


AT&T Labs Research