372537

Appears in sequences

• Number of rooted labeled trees of height at most 2.at n=9A052512
• Triangle T, read by rows, equal to Pascal's triangle to the matrix power of Pascal's triangle, so that T = C^C, where C(n,k) = binomial(n,k) and T(n,k) = A000248(n-k)*C(n,k).at n=46A116071
• Triangle read by rows: T(n,k) = number of rooted labeled trees with n nodes and height <= k, for n >= 1, 0 <= k <= n-1.at n=38A236396
• Triangle read by rows: T(n,k) is the number of partial idempotent mappings (of an n-chain) with breadth exactly k.at n=53A259760