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.

A365621 Minimum size of a set of polyominoes with n cells such that all other free polyominoes with n cells can be obtained by moving one cell of one of the polyominoes in the set.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 3
7 7

List of values

[1, 1, 1, 1, 2, 3, 7]