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 A287589 #6 May 26 2017 20:50:41 %S A287589 1,1,2,5,15,52,203,877,4140,21147,115975,678570,4097621,25396897, %T A287589 160757829,1034542443,6742599834,44362398136,293897938033, %U A287589 1956688777638,13073261821160,87577473173716,587947614677023,3953463212747522,26614587904889651,179316842821307806 %N A287589 Number of set partitions of [n] such that all absolute differences between least elements of consecutive blocks and between consecutive elements within the blocks are not larger than ten. %H A287589 Alois P. Heinz, <a href="/A287589/b287589.txt">Table of n, a(n) for n = 0..1000</a> %H A287589 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a> %F A287589 a(n) = A000110(n) for n <= 11. %Y A287589 Column k=10 of A287417. %Y A287589 Cf. A000110. %K A287589 nonn %O A287589 0,3 %A A287589 _Alois P. Heinz_, May 26 2017