A263339 - OEIS

%I #12 Oct 15 2015 15:30:27

%S 1,1,1,2,1,0,1,5,2,0,1,1,0,0,0,1,0,0,0,0,0,0,0,1,13,3,0,3,1,1,0,0,2,1,

%T 0,1,1,0,0,0,1,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,

%U 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

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

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

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

%e Triangle begins:

%e 1,

%e 1,1,

%e 2,1,0,1,

%e 5,2,0,1,1,0,0,0,1,0,0,0,0,0,0,0,1,

%e ...

%Y Cf. A000088.

%K nonn,tabf

%O 1,4

%A _Christian Stump_, Oct 15 2015