1,1

William Y. C. Chen, Jing Qin and Christian M. Reidys, Crossings and nesting in tangled-diagrams, arXiv 0710.4053.

D_{2,k}(n) = sum_{i=0..n} binom{n}{i} ilde{D}_{2,k}(n-i), where f_k(2n-l) is the number of k-noncrossing matchings over 2n-l. [There were non-ascii characters in this line, and it has been corrupted]

Sequence in context: A121752 A054133 A032118 this_sequence A112944 A060073 A103365

Adjacent sequences: A125657 A125658 A125659 this_sequence A125661 A125662 A125663

nonn

Jing Qin (qj(AT)cfc.nankai.edu.cn), Oct 26 2007