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.

A320727 a(n) is the minimal 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 4
4 5
5 6
6 6
7 8
8 9

List of values

[3, 4, 5, 6, 6, 8, 9]