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 A270958 #5 Mar 27 2016 14:28:01 %S A270958 10,174,1783,15158,121464,965616,7776877,64017975,540759958, %T A270958 4695640591,41947390960,385584558062,3646493831801,35466401895010, %U A270958 354594794206614,3642294128252241,38413175987708429,415694601586123128,4612983463942832627,52460139965678764835 %N A270958 Number of set partitions of [n] having exactly four pairs (m,m+1) such that m+1 is in some block b and m is in block b+1. %H A270958 Alois P. Heinz, <a href="/A270958/b270958.txt">Table of n, a(n) for n = 8..220</a> %H A270958 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a> %e A270958 a(8) = 10: 1358|247|6, 1368|257|4, 136|258|47, 136|25|48|7, 138|257|46, 13|258|47|6, 138|27|46|5, 158|247|36, 15|248|37|6, 18|247|36|5. %Y A270958 Column k=4 of A270953. %K A270958 nonn %O A270958 8,1 %A A270958 _Alois P. Heinz_, Mar 26 2016