Number of combinatorially non-equivalent "triangulations" of a compact genus n surface which have only 1 vertex (all vertices of the triangles are identified). Also the number of combinatorially distinct identifications of pairs of edges of a polygon P having 12g-6 sides leading to a compact oriented genus g surface containing the boundary of P as a 3-regular graph.

A068182

Number of combinatorially non-equivalent "triangulations" of a compact genus n surface which have only 1 vertex (all vertices of the triangles are identified). Also the number of combinatorially distinct identifications of pairs of edges of a polygon P having 12g-6 sides leading to a compact oriented genus g surface containing the boundary of P as a 3-regular graph.

Terms

    a(0) =1a(1) =9a(2) =1726a(3) =1349005a(4) =2169056374

External references