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.

A005334 Number of labeled nonseparable (or 2-connected) bicolored graphs with n nodes of the first color and n nodes of the second color.

Original entry on oeis.org

1, 1, 34, 7037, 6317926, 21073662977, 251973418941994, 10878710974408306717, 1727230695707098000548430, 1028983422758641650604161840065, 2342608062302306704492272616530549874, 20683716767972841770515007707311751484424893
Offset: 1

Views

Author

Keywords

Comments

The two color classes are not interchangeable and have separate labels. Nonseparable graphs are also called blocks.

References

  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Main diagonal of A123301 as an array.

Extensions

Name clarified and more terms added by Andrew Howroyd, Jan 03 2021