login
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
OFFSET
1,6
COMMENTS
The number of nodes in this graph is given by A144215.
LINKS
Rebecca Neville, Graphs whose vertices are forests with bounded degree, Graph Theory Notes of New York, LIV (2008), 12-21. [Wayback Machine link]
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
Cf. A144530.
Sequence in context: A305628 A094721 A301951 * A319498 A349782 A011297
KEYWORD
nonn,tabl,more
AUTHOR
N. J. A. Sloane, Dec 20 2008
STATUS
approved