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 A287282 #10 Dec 27 2018 20:45:35 %S A287282 1,1,2,5,15,52,203,877,4140,21147,115975,678570,4097622,25397924, %T A287282 160822256,1036104634,6767698121,44684050607,297472309232, %U A287282 1992684291665,13410441683599,90565259407669,613287083857871,4161823459675655,28288495888520998,192520455386904133 %N A287282 Number of set partitions of [n] such that for each block all absolute differences between consecutive elements are <= ten. %H A287282 Alois P. Heinz, <a href="/A287282/b287282.txt">Table of n, a(n) for n = 0..1000</a> %H A287282 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 A287282 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a> %F A287282 a(n) = A287214(n,10). %F A287282 a(n) = A000110(n) for n <= 11. %Y A287282 Column k=10 of A287214. %Y A287282 Cf. A000110. %K A287282 nonn %O A287282 0,3 %A A287282 _Alois P. Heinz_, May 22 2017