|
|
A152684
|
|
a(n) is the number of top-down sequences (F_1, F_2, ..., F_n) whereas each F_i is a labeled forest on n nodes, containing i directed rooted trees. F_(i+1) is proper subset of F_i.
|
|
4
|
|
|
1, 2, 18, 384, 15000, 933120, 84707280, 10569646080, 1735643790720, 362880000000000, 94121726392108800, 29658516531078758400, 11159820050604594969600, 4942478402320838374195200, 2544989406021562500000000000, 1507645899890367707813511168000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
REFERENCES
|
Miklos Bona, Introduction to Enumerative Combinatorics, McGraw Hill 2007, Page 276.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = n^(n-2)*(n!).
|
|
EXAMPLE
|
a(1) = 1^(1-2)*(1!) = 1.
a(2) = 2^(2-2)*(2!) = 2.
a(3) = 3^(3-2)*(3!) = 18.
|
|
MAPLE
|
a:= proc(n) option remember; `if`(n=1, 1,
a(n-1)*(n/(n-1))^(n-3)*n^2)
end:
|
|
MATHEMATICA
|
|
|
PROG
|
(Magma) [Factorial(n-1)*n^(n-1): n in [1..20]]; // G. C. Greubel, Nov 28 2022
(SageMath) [factorial(n-1)*n^(n-1) for n in range(1, 21)] # G. C. Greubel, Nov 28 2022
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|