login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A267998 Table array: T(n,k) is Ann_k(2*n+k,k) where Ann_k(n,m) is the number of annular non-crossing matchings of type (n, m) with precisely k cross-cuts. 2
1, 1, 1, 1, 1, 2, 1, 1, 2, 4, 1, 1, 3, 5, 10, 1, 1, 3, 7, 14, 26, 1, 1, 4, 10, 22, 42, 80, 1, 1, 4, 12, 30, 66, 132, 246, 1, 1, 5, 15, 43, 99, 217, 429, 810, 1, 1, 5, 19, 55, 143, 335, 715, 1430, 2704, 1, 1, 6, 22, 73, 201, 504, 1144, 2438, 4862, 9252, 1, 1, 6, 26, 91, 273, 728, 1768, 3978, 8398, 16796, 32066 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

0,6

LINKS

Table of n, a(n) for n=0..77.

Paul Drube and Puttipong Pongtanapaisan, Annular Non-Crossing Matchings, Journal of Integer Sequences, Vol. 19 (2016), #16.2.4.

PROG

(PARI) t(n, k) = if (!n && !k, 1, sumdiv(gcd(n, k), d, eulerphi(d)*binomial((2*n+k)/d, n/d))/(2*n+k));

CROSSREFS

Sequence in context: A136788 A136450 A131054 * A265005 A166288 A327001

Adjacent sequences:  A267995 A267996 A267997 * A267999 A268000 A268001

KEYWORD

nonn,tabl

AUTHOR

Michel Marcus, Jan 24 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 04:10 EDT 2020. Contains 333105 sequences. (Running on oeis4.)