|
%I #3 Feb 27 2009 03:00:00
%S 1,4,4,4,6,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,
%T 27,28,29
%N Minimum number of pieces needed to dissect a square into n smaller squares (not necessarily of the same size).
%H Eric Weisstein et al., <a href="http://mathworld.wolfram.com/Dissection.html">Dissection</a>.
%F a(n) = n for n > 5
%e For n>1, a(2n) = 2n because a square can be dissected into a square with edge (n-1)/n times the original square and a strip of n and a strip of n-1 squares (each with edge 1/n times the original square). For n>1, a(2n+3)= 2n+3 because one square in the above example can be dissected into four equally sized squares.
%K easy,nonn
%O 1,2
%A Johannes Koelman (Joc_Kay(AT)hotmail.com), Feb 14 2005
|
