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.

A359667 a(n) is the number of minimally prolific free polyominoes, i.e., that can generate the least possible number of children by adding a square.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 5
9 1
10 1
11 3
12 1
13 1
14 5
15 1
16 1
17 2
18 2

List of values

[1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 3, 1, 1, 5, 1, 1, 2, 2]