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

Author

Christian Stump, Oct 15 2015

Keywords

• nonn
• tabf

Comments

Row sums give A000088, n >= 1.

Examples

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

Links

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

Crossrefs

Cf. A000088.