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.

A128953 Number of 3-connected bipartite graphs on n unlabeled nodes.

Original entry on oeis.org

1, 1, 6, 12, 85, 471, 5373, 75145, 1543382, 41554738
Offset: 6

Views

Author

Gordon F. Royle, May 10 2007

Keywords

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.