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.

A371868 Number of connected chordal bipartite graphs on n unlabeled vertices.

Original entry on oeis.org

1, 1, 1, 3, 5, 16, 41, 154, 560, 2550, 12404, 69536, 428698, 2947229, 22288540, 185226859, 1682006569, 16635022967, 178525323313
Offset: 1

Views

Author

Brendan McKay, Apr 09 2024

Keywords

Comments

A chordal bipartite graph is a bipartite graph with no induced cycles longer than 4-cycles. Note that this is not the same as a bipartite graph which is chordal, as that would exclude all cycles.

Examples

			The 3 examples for n=4 are the 4-cycle, the star, and the path.
		

Crossrefs