login
A338583
Number of unlabeled 3-connected nonplanar graphs with n edges.
5
1, 2, 3, 10, 29, 94, 343, 1291, 5206, 22061, 96908, 439837, 2053916, 9841412, 48319944, 242857491, 1248629027, 6563581656, 35258560001, 193463945790
OFFSET
9,2
FORMULA
a(n) = A338511(n) - A002840(n).
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.
KEYWORD
nonn,more
AUTHOR
Hugo Pfoertner, Nov 21 2020
STATUS
approved