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.

A340486 Number of unlabeled graphs on n vertices whose independence number is equal to clique number.

Original entry on oeis.org

1, 0, 2, 3, 8, 54, 380, 3462, 83606, 4822240
Offset: 1

Views

Author

Freddy Barrera, Jan 09 2021

Keywords

Examples

			a(3) = 2 because, of the four graphs of order three, only the path graph and its complement have equal independence and clique number, 2 in this case.