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 A287280 #12 Dec 26 2018 15:02:47 %S A287280 1,1,2,5,15,52,203,877,4140,21147,111835,607726,3372147,19006265, %T A287280 108345829,622553137,3596571484,20854506433,121247283115,706276123051, %U A287280 4119684344466,24052768332415,140525287140277,821384370939660,4802655803213444,28087804863005024 %N A287280 Number of set partitions of [n] such that for each block all absolute differences between consecutive elements are <= eight. %H A287280 Alois P. Heinz, <a href="/A287280/b287280.txt">Table of n, a(n) for n = 0..1000</a> %H A287280 Alois P. Heinz, <a href="/A287280/a287280.txt">G.f. for A287280</a> %H A287280 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 A287280 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a> %F A287280 G.f.: see link above. %F A287280 a(n) = A287214(n,8). %F A287280 a(n) = A000110(n) for n <= 9. %Y A287280 Column k=8 of A287214. %Y A287280 Cf. A000110. %K A287280 nonn,easy %O A287280 0,3 %A A287280 _Alois P. Heinz_, May 22 2017