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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

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

%I

%S 1,2,3,1,6,4,1,10,17,6,1,20,72,53,10,1

%N Triangle read by rows: T(n,k) is the number of graphs with n vertices and treewidth k.

%C Row sums give A000088, n >= 1.

%H FindStat - Combinatorial Statistic Finder, <a href="http://www.findstat.org/StatisticsDatabase/St000272">The treewidth of a graph</a>.

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Treewidth">Treewidth</a>

%e Triangle begins:

%e 1,

%e 2,

%e 3,1,

%e 6,4,1,

%e 10,17,6,1,

%e 20,72,53,10,1,

%e ...

%Y Cf. A000088.

%K nonn,tabf,more

%O 1,2

%A _Christian Stump_, Oct 13 2015

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 January 16 15:53 EST 2021. Contains 340206 sequences. (Running on oeis4.)