cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Table of values

n a(n)
1 1
2 1
3 3
4 3
5 14
6 12
7 79
8 56
9 497
10 311

List of values

[1, 1, 3, 3, 14, 12, 79, 56, 497, 311]