|
%I #7 Dec 01 2020 17:10:41
%S 1,0,1,2,3,6,17,37,98,275,797,2414,7613,24510,80721,270018,915034
%N Number of unlabeled connected planar graphs with n edges with degree >= 3 at each node.
%H Hugo Pfoertner, <a href="/A338594/a338594.pdf">Illustrations of terms a(9) - a(11)</a>.
%F a(n) = A338604(n) - A338593(n).
%e a(6) = 1: the 3-connected edge graph of the tetrahedron;
%e a(7) = 0: no connected planar graph with degree >=3 at each node exists;
%e a(8) = 1: the 3-connected 5-wheel graph, edge graph of 4-sided pyramid;
%e a(9)-a(11): see linked illustrations.
%Y Cf. A007112, A002840, A123545, A338511, A338583, A338584, A338593, A338604.
%K nonn,more
%O 6,4
%A _Hugo Pfoertner_, Nov 21 2020
|
