A338583 - OEIS

%I #6 Dec 01 2020 17:10:09

%S 1,2,3,10,29,94,343,1291,5206,22061,96908,439837,2053916,9841412,

%T 48319944,242857491,1248629027,6563581656,35258560001,193463945790

%N Number of unlabeled 3-connected nonplanar graphs with n edges.

%H Hugo Pfoertner, <a href="/A338583/a338583.pdf">Illustrations of terms a(9) - a(12)</a>.

%F a(n) = A338511(n) - A002840(n).

%F a(n) <= A338593(n). The difference A338584(n) = A338593(n)-a(n) are the counts of nonplanar connected graphs with minimum degree 3 at each node that are not 3-connected.

%Y Cf. A002840, A006290, A337517, A338197, A338511, A338573, A338584, A338593, A338594, A338604.

%K nonn,more

%O 9,2

%A _Hugo Pfoertner_, Nov 21 2020