A262322 - 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

A262322

The number of 4-connected triangulations of the triangle with n inner vertices.

1, 0, 0, 1, 1, 3, 13, 47, 217, 1041, 5288, 27844, 150608, 831229

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,6

COMMENTS

Also the number of 4-connected simplicial polyhedra with n nodes with one marked face.

Values obtained by generating 4-connected simplicial polyhedra with plantri, marking each face in the polyhedron, and then sorting out isomorphic ones.

LINKS

Table of n, a(n) for n=0..13.

Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph.

Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph [Cached copy, pdf file only, no active links, with permission]

CROSSREFS

Cf. A002713, A007021.

Sequence in context: A084519 A304628 A265920 * A180278 A193164 A122424

Adjacent sequences: A262319 A262320 A262321 * A262323 A262324 A262325

KEYWORD

nonn,more

AUTHOR

Moritz Firsching, Sep 18 2015

STATUS

approved