Irregular triangle read by rows: T(n,k) is the number of partitions of the vertex set of the labeled n-dimensional hypercube graph into k connected subsets, 1 <= k <= 2^n.
A389983
Irregular triangle read by rows: T(n,k) is the number of partitions of the vertex set of the labeled n-dimensional hypercube graph into k connected subsets, 1 <= k <= 2^n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =6a(5) =4a(6) =1a(7) =1a(8) =63a(9) =268a(10) =345a(11) =202a(12) =66a(13) =12a(14) =1a(15) =1a(16) =10056a(17) =280736a(18) =1741230a(19) =4667148a(20) =6945848a(21) =6531432a(22) =4201440a(23) =1946016a(24) =669652a(25) =173712a(26) =33920a(27) =4888a(28) =496a(29) =32
External references
- oeis: A389983