[1]
Chen, W.Y.C., Qin, J., Reidys, C.M. and Zeilberger, D. 2009. Efficient Counting and Asymptotics of $k$-Noncrossing Tangled Diagrams. The Electronic Journal of Combinatorics. 16, 1 (Mar. 2009), R37. DOI:https://doi.org/10.37236/126.