A338594 Number of unlabeled connected planar graphs with n edges with degree >= 3 at each node.

1, 0, 1, 2, 3, 6, 17, 37, 98, 275, 797, 2414, 7613, 24510, 80721, 270018, 915034

Offset

6,4

Links

Table of n, a(n) for n=6..22.

Hugo Pfoertner, Illustrations of terms a(9) - a(11).

Formula

a(n) = A338604(n) - A338593(n).

Example

a(6) = 1: the 3-connected edge graph of the tetrahedron;
a(7) = 0: no connected planar graph with degree >=3 at each node exists;
a(8) = 1: the 3-connected 5-wheel graph, edge graph of 4-sided pyramid;
a(9)-a(11): see linked illustrations.

Crossrefs

Cf. A007112, A002840, A123545, A338511, A338583, A338584, A338593, A338604.

Sequence in context: A241945 A018284 A204514 * A078344 A024498 A319283

Adjacent sequences: A338591 A338592 A338593 * A338595 A338596 A338597

Keyword

nonn,more

Author

Hugo Pfoertner, Nov 21 2020

Status

approved