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 A276724 #14 Dec 26 2018 15:02:16 %S A276724 1,1,2,5,15,52,203,877,4140,17007,64077,231180,821132,2918753, %T A276724 10483154,38264066,142423894,533308705,1995314365,7437442700, %U A276724 27604521795,102095937121,376790770192,1389739254904,5130664114644,18964932885093,70170215134155,259770146382666 %N A276724 Number of set partitions of [n] such that for each block b the smallest integer interval containing b has at most eight elements. %H A276724 Alois P. Heinz, <a href="/A276724/b276724.txt">Table of n, a(n) for n = 0..1000</a> %H A276724 Alois P. Heinz, <a href="/A276724/a276724.txt">G.f. for A276724</a> %H A276724 Pierpaolo Natalini, Paolo Emilio Ricci, <a href="https://doi.org/10.3390/axioms7040071">New Bell-Sheffer Polynomial Sets</a>, Axioms 2018, 7(4), 71. %H A276724 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a> %F A276724 G.f.: see link above. %Y A276724 Column k=8 of A276719. %Y A276724 Cf. A276842, A276898. %K A276724 nonn,easy %O A276724 0,3 %A A276724 _Alois P. Heinz_, Sep 16 2016