A263339 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,4

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

Sequence in context: A292973 A220235 A066603 * A244372 A370773 A119331

Adjacent sequences: A263336 A263337 A263338 * A263340 A263341 A263342

KEYWORD

nonn,tabf

AUTHOR

Christian Stump, Oct 15 2015

STATUS

approved