Triangle read by rows: T(n, k) is the number of labeled trees on n nodes with maximal node degree k (0 < k < n).

A061356

Triangle read by rows: T(n, k) is the number of labeled trees on n nodes with maximal node degree k (0 < k < n).

Terms

    a(0) =1a(1) =2a(2) =1a(3) =9a(4) =6a(5) =1a(6) =64a(7) =48a(8) =12a(9) =1a(10) =625a(11) =500a(12) =150a(13) =20a(14) =1a(15) =7776a(16) =6480a(17) =2160a(18) =360a(19) =30a(20) =1a(21) =117649a(22) =100842a(23) =36015a(24) =6860a(25) =735a(26) =42a(27) =1a(28) =2097152a(29) =1835008

External references