|
| |
|
|
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.
|
|
0
| |
|
|
1, 2, 18, 384, 15000, 933120, 84707280, 10569646080, 1735643790720, 362880000000000, 94121726392108800, 29658516531078758400
(list; graph; refs; listen; history; internal format)
|
| |
| |
|
|