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.

A316531 a(n) is the maximum number of perfect matchings of a graph with 2n vertices that contains exactly three disjoint perfect matchings.

Table of values

n a(n)
2 3
3 6
4 9
5 13
6 20
7 32
8 52

List of values

[3, 6, 9, 13, 20, 32, 52]