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.

A362938 a(n) = minimum number of pieces needed to dissect a regular n-sided polygon into a monotile, i.e. a polygonal tile which tiles the plane (conjectured).

Table of values

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

List of values

[1, 1, 2, 1, 3, 2, 3, 2, 4, 3, 4, 3, 5, 4, 6]