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!)
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; text; internal format)
OFFSET
6,2
REFERENCES
O. Bernardi, On triangulations with high vertex degree, Formal Power Series and Algebraic Combinatorics 2005.
LINKS
CROSSREFS
Sequence in context: A126959 A181328 A058861 * A192768 A179325 A064856
KEYWORD
nonn
AUTHOR
Olivier Bernardi (bernardi(AT)labri.fr), May 04 2005
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 June 23 18:37 EDT 2024. Contains 373653 sequences. (Running on oeis4.)