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

A385929 Number of simple, undirected, prime graphs G on n unlabeled vertices with no degree-1 vertex in G or its complement, as well as having no induced P5 in G or in its complement.

Original entry on oeis.org

0, 0, 0, 0, 1, 0, 0, 1, 9, 142
Offset: 1

Views

Author

Jim Nastos and Clara Elliott, Jul 12 2025

Keywords

Comments

Here, "prime" means with respect to modular decomposition (see link). A P5 is a path on 5 vertices.

Examples

			The only such graph on n=5 is the C5. The only such graph on n=8 is the split graph called the 4-sun (see the House of Graphs link).
		

Crossrefs

Showing 1-1 of 1 results.