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.

Showing 1-1 of 1 results.

A260811 Number of trivalent bipartite connected simple graphs with 2n nodes and girth at least 6.

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 0, 1, 1, 3, 10, 28, 162, 1201, 11415, 125571, 1514489
Offset: 0

Views

Author

Dylan Thurston, Jul 31 2015

Keywords

Comments

The null graph on 0 vertices is vacuously connected, 3-regular, and bipartite; since it is acyclic, it has infinite girth.

Links

Crossrefs

Connected 3-regular simple graphs with girth at least g: A185131 (triangle); chosen g: A002851 (g=3), A014371 (g=4), A014372 (g=5), A014374 (g=6), A014375 (g=7), A014376 (g=8).
Connected bipartite trivalent simple graphs with girth at least g: A006823 (g=4), this sequence (g=6), A260813 (g=8).
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.