Number of ordered set partitions of [n] where k = six is minimal such that for each block b the smallest integer interval containing b has at most k elements.
A320619
Number of ordered set partitions of [n] where k = six is minimal such that for each block b the smallest integer interval containing b has at most k elements.
Terms
- a(0) =541a(1) =7818a(2) =94560a(3) =1135776a(4) =14198988a(5) =189532744a(6) =2716968332a(7) =41443110120a(8) =669224125374
External references
- oeis: A320619