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 A192127 #23 Dec 04 2016 10:44:33
%S A192127 1,1,2,5,15,52,203,877,4140,21147,115975,678570,4213596,27644383,
%T A192127 190897649,1382919174,10479355676,82850735298,681840170501,
%U A192127 5828967784989,51665915664913,473990899143781,4493642492511044,43959218211619150
%N A192127 Number of set partitions of {1, ..., n} that avoid 6-nestings.
%C A192127 This is equal to the number of set partitions of {1, ..., n} that avoid 6-crossings.
%H A192127 M. Bousquet-Mélou and G. Xin, <a href="https://arxiv.org/abs/math/0506551">On partitions avoiding 3-crossings</a>, arXiv:math/0506551 [math.CO], 2005-2006.
%H A192127 Sophie Burrill, Sergi Elizalde, Marni Mishna and Lily Yen, <a href="http://arxiv.org/abs/1108.5615">A generating tree approach to k-nonnesting partitions and permutations</a>, arXiv preprint arXiv:1108.5615 [math.CO], 2011.
%H A192127 W. Chen, E. Deng, R. Du, R. Stanley, and C. Yan, <a href="https://arxiv.org/abs/math/0501230">Crossings and nestings of matchings and partitions</a>, arXiv:math/0501230 [math.CO], 2005.
%H A192127 M. Mishna and L. Yen, <a href="http://arxiv.org/abs/1106.5036">Set partitions with no k-nesting</a>, arXiv:1106.5036 [math.CO], 2011-2012.
%e A192127 There are 4213597 partitions of 12 elements, but a(12)=4213597 because the partition {1,12}{2,11}{3,10}{4,9}{5,8}{6,7} has a 6-nesting.
%Y A192127 Cf. A108304, A108305, A192126.
%K A192127 nonn
%O A192127 0,3
%A A192127 _Marni Mishna_, Jun 23 2011