660032
domain: N
Appears in sequences
- Schroeder's fourth problem; also series-reduced rooted trees with n labeled leaves; also number of total partitions of n.at n=8A000311
- Triangle read by rows: number of generic n-rook placements with k rooks below the main diagonal.at n=21A269744
- Inverse matrix of A135494.at n=28A298673
- Triangle read by rows: T(n,k) is the number of lone-child-avoiding rooted trees with n leaves of exactly k colors.at n=35A319376
- Triangle read by rows: T(n,k) is the number of homeomorphically irreducible leaf colored trees with n leaves using exactly k colors.at n=54A339780
- Table read by descending antidiagonals. T(n,k) is the big Ramsey degree of k in w^n, where w is the first transfinite ordinal, omega.at n=47A364026