A018835 Minimal number of smaller integer-sided squares that tile an n X n square.

4, 6, 4, 8, 4, 9, 4, 6, 4, 11, 4, 11, 4, 6, 4, 12, 4, 13, 4, 6, 4, 13, 4, 8, 4, 6, 4, 14, 4, 15, 4, 6, 4, 8, 4, 15, 4, 6, 4, 15, 4, 16, 4, 6, 4, 16, 4, 9, 4, 6, 4, 16, 4, 8, 4, 6, 4, 17, 4, 17, 4, 6, 4, 8, 4

Offset: 2

Author

David W. Wilson

Keywords

• nonn

Comments

Sascha Kurz has found a(n) for n <= 104, and up to this point he observes that a(n) is given by a(n) = min{ a(p) | p prime, p divides n } (cf. A211302). - N. J. A. Sloane, Apr 07 2012

Links

• Ed Wynn, Table of n, a(n) for n = 2..126
• Sascha Kurz, Squaring the square with integer linear programming, Journal of Information Processing, Vol. 20, Nr. 3 (2012), Pages 680-685; arXiv:1401.6387 [math.OC], 2014.
• Ed Wynn, Exhaustive generation of Mrs Perkins's quilt square dissections for low orders, arXiv:1308.5420 [math.CO], 2013.

Crossrefs

Cf. A211302.

Extensions

Extended by David W. Wilson, using values from A211302

b-file from Wynn, 2013, added by N. J. A. Sloane, Nov 29 2013