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.

A287023 Number of simple disconnected weakly perfect graphs on n vertices.

Original entry on oeis.org

0, 1, 2, 5, 13, 43, 186, 1187, 13006, 270900, 11286208
Offset: 1

Views

Author

Eric W. Weisstein, May 18 2017

Keywords

Comments

First differs from A287008 (number of simple disconnected graphs with equal chromatic and fractional chromatic number) at a(8).

Crossrefs

Cf. A198634 (number of not necessarily connected simple weakly perfect graphs).
Cf. A287009 (number of not connected simple weakly perfect graphs).
Cf. A287008 (number of simple disconnected graphs with equal chromatic and fractional chromatic number).

Formula

a(n) = A198634(n) - A287009(n).

Extensions

a(11) from formula by Falk Hüffner, Aug 13 2017