login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A263294 Triangle read by rows: T(n,k) is the number of graphs with n vertices and treewidth k. 0
1, 2, 3, 1, 6, 4, 1, 10, 17, 6, 1, 20, 72, 53, 10, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Row sums give A000088, n >= 1.

LINKS

Table of n, a(n) for n=1..16.

FindStat - Combinatorial Statistic Finder, The treewidth of a graph.

Wikipedia, Treewidth

EXAMPLE

Triangle begins:

1,

2,

3,1,

6,4,1,

10,17,6,1,

20,72,53,10,1,

...

CROSSREFS

Cf. A000088.

Sequence in context: A114576 A198724 A223486 * A205112 A173161 A116468

Adjacent sequences:  A263291 A263292 A263293 * A263295 A263296 A263297

KEYWORD

nonn,tabf,more

AUTHOR

Christian Stump, Oct 13 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 1 13:33 EST 2020. Contains 338843 sequences. (Running on oeis4.)