Irregular triangle read by rows: T(n,k) is the number of partitions of the vertex set of the n-cocktailparty graph into k connected subsets, 1 <= k <= 2*n.
A389985
Irregular triangle read by rows: T(n,k) is the number of partitions of the vertex set of the n-cocktailparty graph into k connected subsets, 1 <= k <= 2*n.
Terms
- a(0) =0a(1) =1a(2) =1a(3) =6a(4) =4a(5) =1a(6) =1a(7) =28a(8) =71a(9) =50a(10) =12a(11) =1a(12) =1a(13) =123a(14) =848a(15) =1380a(16) =822a(17) =212a(18) =24a(19) =1a(20) =1a(21) =506a(22) =8705a(23) =29575a(24) =34854a(25) =18172a(26) =4690a(27) =620a(28) =40a(29) =1
External references
- oeis: A389985