10569646080
domain: N
Appears in sequences
- a(n) = 2^(n*(n-1)/2)*n!.at n=7A011266
- Triangle giving a(n,k) = number of k-colored labeled graphs with n nodes.at n=27A046860
- Octo-factorial numbers.at n=7A051189
- 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.at n=7A152684
- Triangle read by rows: T(n,k) = n^k * k!.at n=43A153188
- Triangle read by rows. T(n, k) = n^(n - k) * |Stirling1(n, k)|.at n=37A355006