Largest number of crossing-free matchings on a set S of n points in the plane, that is, a set of floor(n/2) pairwise non-intersecting segments with endpoints in S having no endpoint in common.
A063550
Largest number of crossing-free matchings on a set S of n points in the plane, that is, a set of floor(n/2) pairwise non-intersecting segments with endpoints in S having no endpoint in common.
Terms
- a(0) =1a(1) =1a(2) =3a(3) =3a(4) =14a(5) =12a(6) =79a(7) =56a(8) =497a(9) =311
External references
- oeis: A063550