|
| |
|
|
A134958
|
|
Number of hypertrees with n labeled vertices: analog of A030019 when edges of size 1 are allowed (with no two equal edges).
|
|
10
|
|
|
|
1, 2, 4, 32, 464, 9952, 284608, 10207360, 441006336, 22312355840, 1294525492224, 84749726259200, 6181332806029312, 497099907500220416, 43702202601439608832, 4169993748235341529088, 429217455330896263577600, 47406138617171801211797504
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
|
|
|
FORMULA
|
|
|
|
MAPLE
|
a:= n-> 2^n*`if`(n=0, 1, add(Stirling2(n-1, i)*n^(i-1), i=0...n-1)):
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
