login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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.
3

%I #5 Oct 17 2018 17:05:57

%S 541,7818,94560,1135776,14198988,189532744,2716968332,41443110120,

%T 669224125374,11402985454002,204553341234144,3855820648785642,

%U 76243011649519518,1578630066678711432,34166379193222751952,771672681929886240912,18159430155134639111112

%N 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.

%H Alois P. Heinz, <a href="/A320619/b320619.txt">Table of n, a(n) for n = 6..450</a>

%Y Column k=6 of A276891.

%Y Cf. A320556.

%K nonn

%O 6,1

%A _Alois P. Heinz_, Oct 17 2018