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 A270959 #5 Mar 27 2016 14:28:28 %S A270959 4,127,1856,20074,191967,1753407,15845905,144101608,1329935983, %T A270959 12512797900,120312183453,1183814298898,11928314725101, %U A270959 123117825217659,1301722909447207,14096302961791594,156301760858165116,1773962132569829592,20600385809700410195 %N A270959 Number of set partitions of [n] having exactly five pairs (m,m+1) such that m+1 is in some block b and m is in block b+1. %H A270959 Alois P. Heinz, <a href="/A270959/b270959.txt">Table of n, a(n) for n = 9..220</a> %H A270959 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a> %e A270959 a(9) = 4: 1369|258|47, 136|259|48|7, 139|258|47|6, 159|248|37|6. %Y A270959 Column k=5 of A270953. %K A270959 nonn %O A270959 9,1 %A A270959 _Alois P. Heinz_, Mar 26 2016