Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the label k of the root.
A071211
Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the label k of the root.
Terms
- a(0) =1a(1) =3a(2) =1a(3) =16a(4) =8a(5) =3a(6) =125a(7) =75a(8) =40a(9) =16a(10) =1296a(11) =864a(12) =540a(13) =300a(14) =125a(15) =16807a(16) =12005a(17) =8232a(18) =5292a(19) =3024a(20) =1296a(21) =262144a(22) =196608a(23) =143360a(24) =100352a(25) =65856a(26) =38416a(27) =16807a(28) =4782969a(29) =3720087
External references
- oeis: A071211