A105668 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A105668

Number of non-separable rooted triangulations (with n vertices) in which any vertex has degree at least 4.

%I #1 Jul 19 2005 03:00:00

%S 1,3,12,59,325,1875,11029,65607,393750,2382084,14517939,89091558,

%T 550217901,3418171915,21351207168

%N Number of non-separable rooted triangulations (with n vertices) in which any vertex has degree at least 4.

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

%K nonn

%O 6,2

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