Triangular array read by rows. T(n,k) is the number of rooted labeled trees on n nodes such that the root node has degree k. n>=2, 1<=k<=n-1.

A206429

Triangular array read by rows. T(n,k) is the number of rooted labeled trees on n nodes such that the root node has degree k. n>=2, 1<=k<=n-1.

Terms

    a(0) =2a(1) =6a(2) =3a(3) =36a(4) =24a(5) =4a(6) =320a(7) =240a(8) =60a(9) =5a(10) =3750a(11) =3000a(12) =900a(13) =120a(14) =6a(15) =54432a(16) =45360a(17) =15120a(18) =2520a(19) =210a(20) =7a(21) =941192a(22) =806736a(23) =288120a(24) =54880a(25) =5880a(26) =336a(27) =8a(28) =18874368a(29) =16515072

External references