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.

A287008 Number of disconnected simple graphs on n vertices whose fractional chromatic number equals its chromatic number.

Original entry on oeis.org

0, 1, 2, 5, 13, 43, 186, 1187, 13009, 270986
Offset: 1

Views

Author

Eric W. Weisstein, May 17 2017

Keywords

Crossrefs

Cf. A287007 (number of not-necessarily connected simple graphs on n nodes with fractional chromatic number equal to chromatic number).
Cf. A243252 (number of simple connected graphs on n node with fractional chromatic number equal to chromatic number).

Formula

a(n) = A287007(n) - A243252(n).