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 degree k of the root.
A071210
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 degree k of the root.
Terms
- a(0) =1a(1) =3a(2) =1a(3) =18a(4) =8a(5) =1a(6) =160a(7) =80a(8) =15a(9) =1a(10) =1875a(11) =1000a(12) =225a(13) =24a(14) =1a(15) =27216a(16) =15120a(17) =3780a(18) =504a(19) =35a(20) =1a(21) =470596a(22) =268912a(23) =72030a(24) =10976a(25) =980a(26) =48a(27) =1a(28) =9437184a(29) =5505024
External references
- oeis: A071210