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 A287281 #11 Dec 27 2018 20:45:10 %S A287281 1,1,2,5,15,52,203,877,4140,21147,115975,657423,3827518,22762925, %T A287281 137649001,843059144,5212898020,32457312604,203096802134, %U A287281 1275403897840,8030979290267,50672180941765,320201670174878,2025623521511803,12824705758528817,81244888488645467 %N A287281 Number of set partitions of [n] such that for each block all absolute differences between consecutive elements are <= nine. %H A287281 Alois P. Heinz, <a href="/A287281/b287281.txt">Table of n, a(n) for n = 0..1000</a> %H A287281 Alois P. Heinz, <a href="/A287281/a287281.txt">G.f. for A287281</a> %H A287281 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 A287281 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a> %F A287281 G.f.: see link above. %F A287281 a(n) = A287214(n,9). %F A287281 a(n) = A000110(n) for n <= 10. %Y A287281 Column k=9 of A287214. %Y A287281 Cf. A000110. %K A287281 nonn,easy %O A287281 0,3 %A A287281 _Alois P. Heinz_, May 22 2017