588000

Appears in sequences

• Triangle of number of labeled rooted trees with n nodes and k leaves, n >= 1, 1 <= k <= n.at n=31A055302
• Number of labeled rooted trees with n nodes and 4 leaves.at n=3A055305
• A partition product of Stirling_2 type [parameter k = 2] with biggest-part statistic (triangle read by rows).at n=31A157402
• Triangle read by rows: T(n,k) (n>=1, 4<=k<=n+3) is the number of k-sequences of balls colored with at most n colors such that exactly three balls are of a color seen previously in the sequence.at n=31A292879