%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