Square array read by antidiagonals: T(n,k) is the number of k-edge colored trees on vertex set [n] (n>=2, k>=2).
A248090
Square array read by antidiagonals: T(n,k) is the number of k-edge colored trees on vertex set [n] (n>=2, k>=2).
Terms
- a(0) =2a(1) =3a(2) =6a(3) =4a(4) =18a(5) =24a(6) =5a(7) =36a(8) =168a(9) =120a(10) =6a(11) =60a(12) =528a(13) =2160a(14) =720a(15) =7a(16) =90a(17) =1200a(18) =10920a(19) =35640a(20) =5040a(21) =8a(22) =126a(23) =2280a(24) =34200a(25) =293760a(26) =720720a(27) =40320a(28) =9a(29) =168
External references
- oeis: A248090