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.

A243796 Number of graphs with n nodes that are chordal and Hamiltonian.

Original entry on oeis.org

1, 0, 1, 2, 4, 15, 58, 360, 2793, 28761, 369545, 5914974, 116089531, 2816695796
Offset: 1

Views

Author

Travis Hoppe and Anna Petrone, Jun 27 2014

Keywords

Comments

We generated all biconnected chordal graphs up to 14 vertices using Brendan McKay's Nauty Software and Algorithms, then used a program we wrote to identify Hamiltonian graphs. - Philip Nelson, Ammon Hepworth, Raul A. Ramirez, Dec 16 2017

Crossrefs

Cf. A048192 (chordal graphs), A003216 (Hamiltonian graphs).

Extensions

a(11) added using tinygraph by Falk Hüffner, Aug 15 2017
a(12)-a(14) from Philip Nelson, Dec 16 2017