Triangular array read by rows. T(n,k) is the number of labeled trees with black and white nodes having exactly k black nodes, n>=0, 0<=k<=n.
A249632
Triangular array read by rows. T(n,k) is the number of labeled trees with black and white nodes having exactly k black nodes, n>=0, 0<=k<=n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =3a(7) =9a(8) =9a(9) =3a(10) =16a(11) =64a(12) =96a(13) =64a(14) =16a(15) =125a(16) =625a(17) =1250a(18) =1250a(19) =625a(20) =125a(21) =1296a(22) =7776a(23) =19440a(24) =25920a(25) =19440a(26) =7776a(27) =1296a(28) =16807a(29) =117649
External references
- oeis: A249632