A366224 Number of unlabeled 3-connected graphs on n vertices with girth at least 5.
1, 0, 2, 4, 23, 149, 1670, 23882, 422194, 8544496, 195291551
Offset: 10
Examples
The smallest such graph is the Petersen graph on 10 vertices.
This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
The smallest such graph is the Petersen graph on 10 vertices.