|
%I #6 Dec 01 2020 17:10:26
%S 1,6,28,128,558,2421,10675,47810,217572,1006211
%N Number of unlabeled nonplanar connected graphs with n edges with minimum degree 3 at each node that are not 3-connected.
%H Hugo Pfoertner, <a href="/A338584/a338584.pdf">Illustration of terms a(13) and a(14)</a>.
%F a(n) = A338593(n) - A338583(n).
%Y Cf. A006290, A007112, A123545, A338583, A338593, A338594, A338604.
%K nonn,more
%O 13,2
%A _Hugo Pfoertner_, Nov 21 2020
|
