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.

Showing 1-2 of 2 results.

A287481 Number of (not-necessarily connected) non-chordal simple graphs on n vertices.

Original entry on oeis.org

0, 0, 0, 1, 7, 62, 651, 10227, 260144, 11878410, 1017605477, 165072063493, 50501705362177, 29054148751458689
Offset: 1

Views

Author

Eric W. Weisstein, May 25 2017

Keywords

Links

Crossrefs

Cf. A241843 (simple connected non-chordal graphs).
Cf. A287482 (simple disconnected non-chordal graphs).

Formula

a(n) = A241843(n) + A287482(n).
a(n) = A000088(n) - A048193(n).

Extensions

a(11)-a(14) using formula by Falk Hüffner, Aug 10 2017

A287482 Number of disconnected simple non-chordal graphs on n vertices.

Original entry on oeis.org

0, 0, 0, 0, 1, 8, 70, 724, 10975, 271378, 12152603, 1029799448, 166102803505, 50667847301581
Offset: 1

Views

Author

Eric W. Weisstein, May 25 2017

Keywords

Links

Crossrefs

Cf. A287481 (not-necessarily connected non-chordal graphs).
Cf. A241843 (connected non-chordal graphs).

Formula

a(n) = A287481(n) - A241843(n).

Extensions

a(11)-a(14) using formula by Falk Hüffner, Aug 10 2017
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.