A128953 Number of 3-connected bipartite graphs on n unlabeled nodes.
1, 1, 6, 12, 85, 471, 5373, 75145, 1543382, 41554738
Offset: 6
Examples
a(6) = 1 because the complete bipartite graph K_{3,3} is the only 3-connected bipartite graph on 6 vertices.
Crossrefs
Cf. A005142.