A294218 - OEIS

A294218

Triangle read by rows: T(n,k) is the number of graphs with n vertices and arboricity k (n >= 1, 1 <= k <= ceiling(n/2)).

1, 2, 3, 1, 6, 5, 10, 22, 2, 20, 114, 22, 37, 703, 300, 4, 76, 5946, 6204, 120, 153, 68505, 198406, 7595, 9, 329, 1042310, 9901453, 1060264, 812

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

OFFSET

1,2

COMMENTS

Row sums give A000088(n).

LINKS

Eric Weisstein's World of Mathematics, Arboricity

FORMULA

T(n,1) = A005195(n).

EXAMPLE

Triangle begins:

3,1;

6,5;

10,22,2;

20,114,22;

37,703,300,4;

76,5946,6204,120;

CROSSREFS

Cf. A000088 (simple graphs on n nodes).

Cf. A005195 (forests on n nodes).

KEYWORD

nonn,tabf

AUTHOR

EXTENSIONS

Row 10 from Eric W. Weisstein, Nov 21 2017

STATUS

approved