A144529 - cp's OEIS frontend

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.

n	a(n)
1	0
2	0
3	1
4	0
5	1
6	2
7	0
8	2
9	5
10	6
11	0
12	2
13	9
14	13
15	14
16	0
17	3
18	18
19	32
20	36
21	37
22	0
23	3
24	28
25	67
26	82
27	87
28	88

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