login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
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
KEYWORD
nonn
AUTHOR
Olivier Bernardi (bernardi(AT)labri.fr), May 04 2005
STATUS
approved