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.

A362908 Number of graphs on n unlabeled nodes with treewidth 2.

Original entry on oeis.org

0, 0, 0, 1, 4, 17, 72, 323, 1639, 9203
Offset: 0

Views

Author

Martin Rubey, May 09 2023

Keywords

Examples

			There is a single graph of treewidth 2 on 3 vertices, which is the complete graph.
		

Crossrefs

Column 2 of A263294.

Programs

  • SageMath
    [sum(1 for g in graphs(n) if g.treewidth() == 2) for n in range(9)]