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.

A241843 Number of simple connected graphs on n nodes that are non-chordal.

Original entry on oeis.org

0, 0, 0, 1, 6, 54, 581, 9503, 249169, 11607032, 1005452874, 164042264045, 50335602558672, 29003480904157108
Offset: 1

Views

Author

Travis Hoppe and Anna Petrone, Apr 29 2014

Keywords

Crossrefs

Cf. A287481 (not-necessarily connected simple non-chordal graphs).
Cf. A287482 (disconnected simple non-chordal graphs).

Formula

a(n) = A001349(n) - A048192(n).
a(n) = A287481(n) - A287482(n). - Eric W. Weisstein, May 26 2017

Extensions

a(13) and a(14) from formula by Falk Hüffner, Jan 15 2016

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

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
Showing 1-2 of 2 results.