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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A268041 Table array: T(n,m) is the number of non-crossings matchings of curves embedded within an annulus with n exterior endpoints and m interior endpoints. 1
1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 2, 1, 2, 1, 2, 0, 0, 0, 0, 0, 0, 4, 2, 3, 2, 3, 2, 4, 0, 0, 0, 0, 0, 0, 0, 0, 10, 5, 7, 3, 7, 3, 7, 5, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 26, 14, 17, 8, 14, 8, 14, 8, 17, 14, 26, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 80, 42, 48, 24, 38, 20, 34, 20, 38, 24, 48, 42, 80 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,11
LINKS
Paul Drube and Puttipong Pongtanapaisan, Annular Non-Crossing Matchings, Journal of Integer Sequences, Vol. 19 (2016), #16.2.4.
PROG
(PARI) tnnk(n, k) = if (!n && !k, 1, sumdiv(gcd(n, k), d, eulerphi(d)*binomial((2*n+k)/d, n/d))/(2*n+k));
tnmk(n, m, k) = if (k==0, tnnk(n, 0)*tnnk(m, 0), k*sumdiv(gcd(k, gcd(n, m)), d, eulerphi(d)*binomial((2*n+k)/d, n/d)*binomial((2*m+k)/d, m/d))/((2*n+k)*(2*m+k)));
a(n, m) = {if ((n+m) % 2, return (0)); if (n<m, return (a(m, n))); sum(k=0, m, if (!((n-k)%2) && !((m-k)%2), tnmk((n-k)/2, (m-k)/2, k), 0)); }
CROSSREFS
Cf. A267998.
Sequence in context: A140324 A323284 A010250 * A348248 A060024 A143668
KEYWORD
nonn,tabl
AUTHOR
Michel Marcus, Jan 25 2016
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 December 9 23:06 EST 2023. Contains 367696 sequences. (Running on oeis4.)