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 size k of the subtree rooted at the vertex labeled by 1.

A071209

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 size k of the subtree rooted at the vertex labeled by 1.

Terms

    a(0) =0a(1) =1a(2) =1a(3) =0a(4) =3a(5) =8a(6) =3a(7) =0a(8) =16a(9) =81a(10) =32a(11) =18a(12) =0a(13) =125a(14) =1024a(15) =405a(16) =240a(17) =160a(18) =0a(19) =1296a(20) =15625a(21) =6144a(22) =3645a(23) =2560a(24) =1875a(25) =0a(26) =16807a(27) =279936a(28) =109375a(29) =64512

External references