login
A362907
Number of graphs on n unlabeled nodes with treewidth 3.
1
0, 0, 0, 0, 1, 6, 53, 501, 5889, 81786
OFFSET
0,6
EXAMPLE
There is a single graph of treewidth 3 on 4 vertices, which is the complete graph.
PROG
(SageMath) [sum(1 for g in graphs(n) if g.treewidth() == 3) for n in range(9)]
CROSSREFS
Column k=3 of A263294.
Sequence in context: A027835 A055973 A223345 * A369506 A066357 A276365
KEYWORD
nonn,hard,more
AUTHOR
Martin Rubey, May 09 2023
STATUS
approved