A276892 - cp's OEIS frontend

A276892 Number of ordered set partitions of [2n] where k=n is minimal such that for each block b the smallest integer interval containing b has at most k elements.

%I A276892 #5 Sep 22 2016 07:30:45
%S A276892 1,2,20,878,79682,12043772,2716968332,853336081124,355520118746132,
%T A276892 189580735777428836,125874638274228457172,101804159684084842005380,
%U A276892 98514573603328714169588852,112376135259125932230989633060,149216698787792363945310009639572
%N A276892 Number of ordered set partitions of [2n] where k=n is minimal such that for each block b the smallest integer interval containing b has at most k elements.
%F A276892 a(n) = A276891(2n,n).
%Y A276892 Cf. A276728, A276891.
%K A276892 nonn
%O A276892 0,2
%A A276892 _Alois P. Heinz_, Sep 21 2016

cp's OEIS Frontend

A276892 Number of ordered set partitions of [2n] where k=n is minimal such that for each block b the smallest integer interval containing b has at most k elements.