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.

A287511 Number of simple connected perfect non-bipartite graphs on n vertices.

Original entry on oeis.org

0, 0, 1, 3, 15, 88, 680, 7623, 126047, 3118189, 112367111, 5736020864
Offset: 1

Views

Author

Eric W. Weisstein, May 26 2017

Keywords

Crossrefs

Formula

a(n) = A052433(n) - A005142(n), since all bipartite graphs are perfect. - Falk Hüffner, Aug 10 2017

Extensions

a(11)-a(12) from formula by Falk Hüffner, Aug 10 2017