A320615 - cp's OEIS frontend

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.

%I A320615 #5 Oct 17 2018 16:42:09
%S A320615 1,4,20,114,750,5616,47304,443400,4582200,51790320,635791680,
%T A320615 8426915280,119960552880,1825701857280,29585590473600,508653914267520,
%U A320615 9248148480574080,177303557272262400,3574966680853747200,75628468328518828800,1675003757666567328000
%N 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.
%H A320615 Alois P. Heinz, <a href="/A320615/b320615.txt">Table of n, a(n) for n = 2..450</a>
%Y A320615 Column k=2 of A276891.
%K A320615 nonn
%O A320615 2,2
%A A320615 _Alois P. Heinz_, Oct 17 2018

cp's OEIS Frontend

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.