54717165360
domain: N
Appears in sequences
- a(n) = binomial(n+9, 9)*9^n.at n=7A197194
- Number of labeled forests with 2n nodes consisting of n-1 isolated nodes and a labeled tree with n+1 nodes.at n=7A332958
- Triangle read by rows: T(n,k) is the number of labeled forests with n trees and 2n nodes and with the largest tree having exactly k nodes, (n >= 1, 2 <= k <= n+1).at n=35A332959