A263230 - OEIS

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

(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..100.

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

EXAMPLE

Triangle begins:

3,0,1,

6,0,2,1,0,0,0,1,0,0,0,0,0,0,0,1,