A102126 Minimum number of pieces needed to dissect a square into n smaller squares (not necessarily of the same size).

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, 27, 28, 29

Offset

1,2

Links

Table of n, a(n) for n=1..29.

Eric Weisstein et al., Dissection.

Formula

a(n) = n for n > 5

Example

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.

Crossrefs

Sequence in context: A098013 A073229 A116446 * A277433 A219760 A097918

Adjacent sequences: A102123 A102124 A102125 * A102127 A102128 A102129

Keyword

easy,nonn

Author

Johannes Koelman (Joc_Kay(AT)hotmail.com), Feb 14 2005

Status

approved