cp's OEIS Frontend

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.

A338414 Number of labeled 3-connected graphs with n edges.

Original entry on oeis.org

1, 0, 15, 80, 493, 5730, 45790, 501690, 5747805, 66738169, 884847355, 12032825028, 174686734180, 2698980641742, 43470161714616, 739558796434277, 13161203468888236, 244555222834161480
Offset: 6

Views

Author

Andrew Howroyd, Nov 07 2020

Keywords

Comments

The initial terms of this sequence were computed from A123542.
The smallest 3-connected graph is the complete graph on 4 vertices which has 6 edges.

Crossrefs