login
A263339
Triangle read by rows: T(n,k) is the number of graphs with n vertices and k spanning trees.
0
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, 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, 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
OFFSET
1,4
COMMENTS
Row sums give A000088, n >= 1.
LINKS
FindStat - Combinatorial Statistic Finder, The number of spanning trees of a graph.
EXAMPLE
Triangle begins:
1,
1,1,
2,1,0,1,
5,2,0,1,1,0,0,0,1,0,0,0,0,0,0,0,1,
...
CROSSREFS
Cf. A000088.
Sequence in context: A292973 A220235 A066603 * A244372 A370773 A119331
KEYWORD
nonn,tabf
AUTHOR
Christian Stump, Oct 15 2015
STATUS
approved