|
|
A078793
|
|
Number of unlabeled 4-trees on n vertices.
|
|
6
|
|
|
0, 0, 0, 1, 1, 1, 2, 5, 15, 64, 331, 2150, 15817, 127194, 1077639, 9466983, 85252938, 782238933, 7283470324, 68639621442, 653492361220, 6276834750665, 60759388837299, 592227182125701, 5808446697002391, 57289008242377068, 567939935463185078
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,7
|
|
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
|
Eric Weisstein's World of Mathematics, k-Tree
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|