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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105668 Number of non-separable rooted triangulations (with n vertices) in which any vertex has degree at least 4. 0
1, 3, 12, 59, 325, 1875, 11029, 65607, 393750, 2382084, 14517939, 89091558, 550217901, 3418171915, 21351207168 (list; graph; refs; listen; history; internal format)
OFFSET

6,2

REFERENCES

O. Bernardi, On triangulations with high vertex degree, Formal Power Series and Algebraic Combinatorics 2005.

CROSSREFS

Sequence in context: A126959 A181328 A058861 * A192768 A179325 A064856

Adjacent sequences:  A105665 A105666 A105667 * A105669 A105670 A105671

KEYWORD

nonn

AUTHOR

Olivier Bernardi (bernardi(AT)labri.fr), May 04 2005

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 15 06:52 EST 2012. Contains 205694 sequences.