This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A320616 #6 Oct 17 2018 16:47:44 %S A320616 3,18,118,878,7224,65514,652446,7092672,83679936,1065839544, %T A320616 14586155400,213544496760,3331500035160,55190744651520, %U A320616 967799429431920,17911992891306240,348981340420308960,7140367412382592080,153090240159322655280,3432492956469166894080 %N 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. %H A320616 Alois P. Heinz, <a href="/A320616/b320616.txt">Table of n, a(n) for n = 3..450</a> %Y A320616 Column k=3 of A276891. %Y A320616 Cf. A320553. %K A320616 nonn %O A320616 3,1 %A A320616 _Alois P. Heinz_, Oct 17 2018