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 A270961 #5 Mar 27 2016 14:29:22 %S A270961 36,1260,23258,324891,3968251,45402693,504270360,5543886289, %T A270961 61008463952,676542685621,7591571114493,86426778077884, %U A270961 999973097589274,11771498403908062,141085372337100460,1722345651885728412,21421106761851959049,271444082790121795320 %N A270961 Number of set partitions of [n] having exactly seven pairs (m,m+1) such that m+1 is in some block b and m is in block b+1. %H A270961 Alois P. Heinz, <a href="/A270961/b270961.txt">Table of n, a(n) for n = 12..220</a> %H A270961 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a> %e A270961 a(12) = 36: 1358(12)|247(11)|6(10)|9, 1368(12)|257(11)|4(10)|9, 1369(12)|258(11)|47(10), 1369|258(12)|47(11)|(10), 136(12)|258(11)|47(10)|9, 136(10)(12)|259(11)|48|7, 136(10)|259(12)|48(11)|7, 136(10)|259|48(12)|7(11), 136(10)|259|48|7(12)|(11), 136(12)|259(11)|48(10)|7, 136|259(12)|48(11)|7(10), 136|259|48(12)|7(11)|(10), 136(12)|25(11)|48(10)|79, 136|25(12)|48(11)|7(10)|9, 136(12)|25(11)|4(10)|79|8, 138(12)|257(11)|46(10)|9, 139(12)|258(11)|47(10)|6, 139|258(12)|47(11)|6(10), 139|258|47(12)|6(11)|(10), 13(12)|258(11)|47(10)|69, 13|258(12)|47(11)|6(10)|9, 13(12)|25(11)|47(10)|69|8, 138(12)|27(11)|46(10)|59, 138|27(12)|46(11)|5(10)|9, 13(12)|27(11)|46(10)|59|8, 158(12)|247(11)|36(10)|9, 159(12)|248(11)|37(10)|6, 159|248(12)|37(11)|6(10), 159|248|37(12)|6(11)|(10), 15(12)|248(11)|37(10)|69, 15|248(12)|37(11)|6(10)|9, 15(12)|24(11)|37(10)|69|8, 18(12)|247(11)|36(10)|59, 18|247(12)|36(11)|5(10)|9, 1(12)|247(11)|36(10)|59|8, 17(12)|26(11)|35(10)|49|8. %Y A270961 Column k=7 of A270953. %K A270961 nonn %O A270961 12,1 %A A270961 _Alois P. Heinz_, Mar 26 2016