|
%I #27 Mar 20 2017 14:21:34
%S 1,0,0,1,1,3,13,47,217,1041,5288,27844,150608,831229
%N The number of 4-connected triangulations of the triangle with n inner vertices.
%C Also the number of 4-connected simplicial polyhedra with n nodes with one marked face.
%C Values obtained by generating 4-connected simplicial polyhedra with plantri, marking each face in the polyhedron, and then sorting out isomorphic ones.
%H Gunnar Brinkmann and Brendan McKay, <a href="http://users.cecs.anu.edu.au/~bdm/plantri/">plantri and fullgen</a> programs for generation of certain types of planar graph.
%H Gunnar Brinkmann and Brendan McKay, <a href="/A000103/a000103_1.pdf">plantri and fullgen</a> programs for generation of certain types of planar graph [Cached copy, pdf file only, no active links, with permission]
%Y Cf. A002713, A007021.
%K nonn,more
%O 0,6
%A _Moritz Firsching_, Sep 18 2015
|
