A320617 - cp's OEIS frontend

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

%I A320617 #4 Oct 17 2018 16:51:43
%S A320617 13,114,924,8152,79682,845874,9699504,119751978,1586912838,
%T A320617 22489462512,339643322952,5448229269576,92547041455104,
%U A320617 1660105401121800,31366215961317480,622755664408102200,12964583019385962840,282431877654287832480,6426548730391132252800
%N A320617 Number of ordered set partitions of [n] where k = four is minimal such that for each block b the smallest integer interval containing b has at most k elements.
%H A320617 Alois P. Heinz, <a href="/A320617/b320617.txt">Table of n, a(n) for n = 4..450</a>
%Y A320617 Column k=4 of A276891.
%Y A320617 Cf. A320554.
%K A320617 nonn
%O A320617 4,1
%A A320617 _Alois P. Heinz_, Oct 17 2018

cp's OEIS Frontend

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