|
%I #4 Mar 30 2012 16:50:19
%S 1,4,4,6,1,6,5,6,6,5
%N 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).
%C I do not know which of these values have been proved to be minimal.
%C Turning over is allowed. The pieces must be bounded by simple curves to avoid difficulties with non-measurable sets.
%C See A110312 for further references and illustrations.
%D G. N. Frederickson, Dissections: Plane and Fancy, Cambridge, 1997.
%e Array begins:
%e 1 4 6 5 8 7 ... <= A110000
%e 4 1 6 5 7 5 9 ... <= A110312
%e 6 6 1 7 ...
%e 5 5 7 1 ...
%e 8 7 ...
%e ...
%Y Row 3 gives A110000, row 4 gives A110312.
%K nonn,tabl
%O 3,2
%A _N. J. A. Sloane_, Sep 11 2005
|
