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.

A277686 The number of nonisomorphic graphs on n vertices whose chromatic symmetric function in the p basis has a nonzero coefficient for each possible term.

Original entry on oeis.org

1, 1, 2, 5, 20, 91, 823
Offset: 1

Views

Author

Caleb Ji, Sam Heil, Oct 26 2016

Keywords

Comments

All graphs with a Hamiltonian path are included in this count. The smallest n for which a graph with n vertices satisfies this property and does not have a Hamiltonian path is n=5.

Crossrefs

Cf. A277686.