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.

A110356 Array read by antidiagonals: T(n,k) (n>=3, k>=3) = minimal number of polygonal pieces in a dissection of a regular n-gon to a regular k-gon (conjectured).

Original entry on oeis.org

1, 4, 4, 6, 1, 6, 5, 6, 6, 5
Offset: 3

Views

Author

N. J. A. Sloane, Sep 11 2005

Keywords

Comments

I do not know which of these values have been proved to be minimal.
Turning over is allowed. The pieces must be bounded by simple curves to avoid difficulties with non-measurable sets.
See A110312 for further references and illustrations.

Examples

			Array begins:
1 4 6 5 8 7 ... <= A110000
4 1 6 5 7 5 9 ... <= A110312
6 6 1 7 ...
5 5 7 1 ...
8 7 ...
...
		

References

  • G. N. Frederickson, Dissections: Plane and Fancy, Cambridge, 1997.

Crossrefs

Row 3 gives A110000, row 4 gives A110312.