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.

A361754 The number of free polyominoes of area n that fill their minimal enclosing circle (MEC). A polyomino "fills" its minimal enclosing circle if no square may be added to it that doesn't have some point outside of the circle.

Table of values

n a(n)
1 1
2 1
3 0
4 1
5 1
6 2
7 1
8 1
9 1
10 1
11 1
12 3
13 2
14 2
15 2
16 3
17 2
18 3
19 1
20 3
21 2
22 4
23 1

List of values

[1, 1, 0, 1, 1, 2, 1, 1, 1, 1, 1, 3, 2, 2, 2, 3, 2, 3, 1, 3, 2, 4, 1]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.