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.

A362939 a(n) = minimum number of pieces needed to dissect a regular n-sided polygon into a rectangle (conjectured).

Original entry on oeis.org

2, 1, 4, 3, 5, 4, 7, 4, 9, 5, 10, 7, 10, 9
Offset: 3

Views

Author

N. J. A. Sloane, Aug 31 2023

Keywords

Comments

The dimensions of the rectangle can be anything you want, as long as it is a rectangle.
Turning over is allowed. The pieces must be bounded by simple curves to avoid difficulties with non-measurable sets.
Apart from changing "square" to "rectangle", the rules are the same as in A110312.
I do not know which of these values have been proved to be minimal. Probably only a(3)=2 and a(4)=1.
The three related sequences A110312, A362938, A362939 are exceptions to the usual OEIS policy of requiring that all terms in sequences must be known exactly. These sequences are included because of their importance and in the hope that someone will establish the truth of some of the conjectured values.
The definitions imply that A362938(n) <= a(n) <= A110312(n).

Examples

			See our paper "On dissecting polygons into rectangles" for illustrations of a(n) for all n <= 16 except n=13 and n=15.
		

Crossrefs