|
Search: id:A110356
|
|
|
| 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). |
|
+0
3
|
| |
|
|
OFFSET
|
3,2
|
|
|
COMMENT
|
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.
|
|
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: A098821 A142154 A084458 this_sequence A156583 A086171 A090113
Adjacent sequences: A110353 A110354 A110355 this_sequence A110357 A110358 A110359
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Sep 11 2005
|
|
|
Search completed in 0.002 seconds
|
