A058378 Number of trivalent 2-connected planar graphs with 2n nodes.

0, 1, 1, 3, 8, 29, 114, 583, 3310, 21168, 144622, 1039495, 7731540, 59054465, 802392930, 6593377305

Offset

1,4

Comments

The counts are for abstract isomorphism classes, not for distinct planar embeddings. Brendan McKay, Mar 08 2026

References

A. T. Balaban, Enumeration of Cyclic Graphs, pp. 63-105 of A. T. Balaban, ed., Chemical Applications of Graph Theory, Ac. Press, 1976; see p. 92.

Computed by Brendan McKay and Gunnar Brinkmann using their program "plantri", Dec 19 2000.

Links

Table of n, a(n) for n=1..16.

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]

Gunnar Brinkmann and Brendan McKay, Guide to using plantri [Cached copy, with permission]

M. Meringer, Tables of Regular Graphs

Example

The first two graphs are the complete graph with 4 vertices and the triangular prism with 6 vertices.

Crossrefs

Cf. A005964, A000109, A387146.

Sequence in context: A245889 A350907 A013309 * A063839 A192744 A130470

Adjacent sequences: A058375 A058376 A058377 * A058379 A058380 A058381

Keyword

nonn,nice,more,hard

Author

N. J. A. Sloane, Dec 19 2000

Extensions

a(14)-a(16) added by Brendan McKay, Mar 08 2026

Status

approved