Number of ordered set partitions of [n] where k = three is minimal such that for each block b the smallest integer interval containing b has at most k elements.
A320616
Number of ordered set partitions of [n] where k = three is minimal such that for each block b the smallest integer interval containing b has at most k elements.
Terms
- a(0) =3a(1) =18a(2) =118a(3) =878a(4) =7224a(5) =65514a(6) =652446a(7) =7092672a(8) =83679936a(9) =1065839544a(10) =14586155400a(11) =213544496760
External references
- oeis: A320616