login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 2
1, 4, 4, 6, 1, 6, 5, 6, 6, 5 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

3,2

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.

REFERENCES

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

LINKS

Table of n, a(n) for n=3..12.

EXAMPLE

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 ...

...

CROSSREFS

Row 3 gives A110000, row 4 gives A110312.

Sequence in context: A142154 A084458 A248933 * A200348 A205868 A156583

Adjacent sequences:  A110353 A110354 A110355 * A110357 A110358 A110359

KEYWORD

nonn,tabl

AUTHOR

N. J. A. Sloane, Sep 11 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 21 02:19 EST 2018. Contains 299388 sequences. (Running on oeis4.)