|
|
A322754
|
|
Number of unlabeled 7-trees on n nodes.
|
|
1
|
|
|
0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 5, 15, 64, 342, 2344, 19137, 181098, 1922215, 22472875, 284556458, 3849828695, 54974808527, 819865209740, 12655913153775, 200748351368185, 3253193955012557, 53619437319817482, 895778170144927928, 15129118461773051724
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,10
|
|
COMMENTS
|
A k-tree is recursively defined as follows: K_k is a k-tree and any k-tree on n+1 vertices is obtained by joining a vertex to a k-clique in a k-tree on n vertices.
|
|
REFERENCES
|
Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, page 328.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|