Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Dec 26 2018 15:02:23
%S 1,1,2,5,15,52,203,877,4140,21147,94828,389946,1527058,5846917,
%T 22257299,85116719,329147169,1292371138,5165744159,20781403539,
%U 83617668276,335483033770,1340729704086,5338181115652,21193583922048,84001778063348,332811761809618
%N Number of set partitions of [n] such that for each block b the smallest integer interval containing b has at most nine elements.
%H Alois P. Heinz, <a href="/A276725/b276725.txt">Table of n, a(n) for n = 0..512</a>
%H 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 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%Y Column k=9 of A276719.
%Y Cf. A276843, A276899.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Sep 16 2016