955860

Appears in sequences

• Number of asymmetric trees with n nodes (also called identity trees).at n=24A000220
• Number of unilaterally connected digraphs with n labeled nodes.at n=4A003029
• a(n) = binomial(n^2 * binomial(2*n,n), n).at n=3A119553
• a(n) = (5*n + 3)*(5*n + 4)*(5*n + 5)/6.at n=35A300522