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 A320622 #7 Oct 18 2018 14:52:09 %S A320622 545835,12584310,230967120,4020567144,70085446176,1251488442768, %T A320622 23136897546984,445129521202044,8967451281890920,189580735777428836, %U A320622 4189466666732025552,96503099183372332800,2312171653716970887384,57525923379398601317976,1484102063758068278022054 %N A320622 Number of ordered set partitions of [n] where k = nine is minimal such that for each block b the smallest integer interval containing b has at most k elements. %H A320622 Alois P. Heinz, <a href="/A320622/b320622.txt">Table of n, a(n) for n = 9..448</a> %Y A320622 Column k=9 of A276891. %Y A320622 Cf. A320559. %K A320622 nonn %O A320622 9,1 %A A320622 _Alois P. Heinz_, Oct 17 2018