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 A366776 #18 Nov 18 2023 08:36:41
%S A366776 1,1,2,5,15,52,203,877,4140,21147,115975,678569,4213546,27642948,
%T A366776 190866373,1382340849,10469739750,82701857286,679644668584,
%U A366776 5797647603036,51228938289039,467980667203765
%N A366776 Number of 2-distant 5-noncrossing partitions of {1,...,n}.
%C A366776 a(n+1) is the binomial transform of A192126.
%D A366776 Juan B. Gil and Jordan O. Tirrell, A simple bijection for enhanced, classical, and 2-distant k-noncrossing partitions, Discrete Math. 343 (2020), no. 6, 111705, 5 pp.
%H A366776 Juan B. Gil and Jordan O. Tirrell, <a href="https://arxiv.org/abs/1806.09065">A simple bijection for enhanced, classical, and 2-distant k-noncrossing partitions</a>, arXiv:1806.09065 [math.CO], 2018-2023.
%F A366776 a(n+1) = Sum_{i=0..n} binomial(n,i)*A192126(i).
%e A366776 There are 678570 partitions of 11 elements, but a(11)=678569 because the partition (1,7)(2,8)(3,9)(4,10)(5,11)(6) has a 2-distant 5-crossing.
%Y A366776 Cf. A192126, A366774, A366775.
%K A366776 nonn,more
%O A366776 0,3
%A A366776 _Juan B. Gil_, Nov 13 2023