|
|
A144529
|
|
Triangle read by rows: T(n,k) = number of edges in graph whose vertices are forests with n unlabeled nodes and degree <= k and in which two vertices are joined by an edge if the forests differ (up to isomorphism) by exactly one edge.
|
|
2
|
|
|
0, 0, 1, 0, 1, 2, 0, 2, 5, 6, 0, 2, 9, 13, 14, 0, 3, 18, 32, 36, 37, 0, 3, 28, 67, 82, 87, 88
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
COMMENTS
|
The number of nodes in this graph is given by A144215.
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
0
0 1
0 1 2
0 2 5 6
0 2 9 13 14
0 3 18 32 36 37
0 3 28 67 82 87 88
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|