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 A192865 #18 Jun 02 2025 04:14:16
%S A192865 1,1,2,5,15,52,203,877,4140,21146,115945,678012,4205209,27531954,
%T A192865 189486817,1365888674,10278272450,80503198320,654544093035,
%U A192865 5511256984436,47950929125540
%N A192865 Number of set partitions of {1,...,n} that avoid enhanced 5-crossings (or 5-nestings).
%H A192865 M. Bousquet-Mélou and G. Xin, <a href="http://arXiv.org/abs/math.CO/0506551">On partitions avoiding 3-crossings</a>, math.CO/0506551.
%H A192865 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, 2011
%H A192865 W. Chen, E. Deng, R. Du, R. P. Stanley, and C. Yan, <a href="http://arXiv.org/abs/math.CO/0501230">Crossings and nestings of matchings and partitions</a>, math.CO/0501230
%H A192865 Juan B. Gil, Jordan O. Tirrell, <a href="https://arxiv.org/abs/1806.09065">A simple bijection for classical and enhanced k-noncrossing partitions</a>, arXiv:1806.09065 [math.CO], 2018. Also Discrete Mathematics (2019) Article 111705. doi:10.1016/j.disc.2019.111705
%e A192865 There are 21147 partitions of 9 elements, but a(9)=21146 because the partition {1,9}{2,8}{3,7}{4, 6}{5} has an enhanced 5-nesting.
%Y A192865 Cf. A000110, A108307, A192855
%K A192865 nonn
%O A192865 0,3
%A A192865 _Marni Mishna_, Jul 11 2011