A263230 Triangle read by rows: T(n,k) is the number of graphs with n vertices and k spanning forests.

1, 2, 3, 0, 1, 6, 0, 2, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 10, 0, 6, 2, 1, 0, 0, 3, 1, 0, 1, 1, 0, 0, 0, 2, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0

Offset

1,2

Comments

Row sums give A000088, n >= 1.

Links

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

FindStat - Combinatorial Statistic Finder, The number of spanning forests of a graph.

Example

Triangle begins:
1,
2,
3,0,1,
6,0,2,1,0,0,0,1,0,0,0,0,0,0,0,1,
...

Crossrefs

Cf. A000088.

Sequence in context: A360380 A370505 A370507 * A364257 A366258 A319665

Adjacent sequences: A263227 A263228 A263229 * A263231 A263232 A263233

Keyword

nonn,tabf

Author

Christian Stump, Oct 15 2015

Status

approved