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 A320623 #4 Oct 18 2018 14:45:59 %S A320623 7087261,183779178,3762089520,72416697816,1384785261888, %T A320623 26933164023936,538943434056240,11161053068862792,239918736073504524, %U A320623 5377267055166042184,125874638274228457172,3067862283177425632176,77667019131362612168256,2038671040407878313592224 %N A320623 Number of ordered set partitions of [n] where k = ten is minimal such that for each block b the smallest integer interval containing b has at most k elements. %H A320623 Alois P. Heinz, <a href="/A320623/b320623.txt">Table of n, a(n) for n = 10..300</a> %Y A320623 Column k=10 of A276891. %Y A320623 Cf. A320560. %K A320623 nonn %O A320623 10,1 %A A320623 _Alois P. Heinz_, Oct 17 2018