Number of ordered set partitions of [n] where k = two is minimal such that for each block b the smallest integer interval containing b has at most k elements.
A320615
Number of ordered set partitions of [n] where k = two is minimal such that for each block b the smallest integer interval containing b has at most k elements.
Terms
- a(0) =1a(1) =4a(2) =20a(3) =114a(4) =750a(5) =5616a(6) =47304a(7) =443400a(8) =4582200a(9) =51790320a(10) =635791680a(11) =8426915280a(12) =119960552880
External references
- oeis: A320615