login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125660 Number of 3-noncrossing tangled-diagrams. 0
2, 7, 39, 292, 2635, 27019, 304162, 3677313 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
William Y. C. Chen, Jing Qin and Christian M. Reidys, Crossings and nesting in tangled-diagrams, arXiv:0710.4053 [math.CO], 2007.
FORMULA
D_{2,k}(n) = Sum_{i=0..n} binomial(n,i) * T_{2,k} (n-i), where T_{2,k}(n) = Sum_{L=0..n} binomial(n,L) * f_k(2n-L), and f_k(2n-L) is the number of k-noncrossing matchings over 2n-L vertices. [edited, using formulas from p. 12 of the paper by Chen et al., by Jon E. Schoenfield, Jul 21 2019]
CROSSREFS
Sequence in context: A266310 A032118 A369087 * A112944 A060073 A322152
KEYWORD
nonn,more
AUTHOR
Jing Qin (qj(AT)cfc.nankai.edu.cn), Oct 26 2007
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 01:34 EDT 2024. Contains 370952 sequences. (Running on oeis4.)