%I #40 Sep 27 2020 08:47:34
%S 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,
%T 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,
%U 4,8,4
%N Minimal number of smaller integer-sided squares that tile an n X n square.
%C _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
%H Ed Wynn, <a href="/A018835/b018835.txt">Table of n, a(n) for n = 2..126</a>
%H Sascha Kurz, <a href="https://arxiv.org/abs/1401.6387">Squaring the square with integer linear programming</a>, Journal of Information Processing, Vol. 20, Nr. 3 (2012), Pages 680-685; arXiv:1401.6387 [math.OC], 2014.
%H Ed Wynn, <a href="http://arxiv.org/abs/1308.5420">Exhaustive generation of Mrs Perkins's quilt square dissections for low orders</a>, arXiv:1308.5420 [math.CO], 2013.
%Y Cf. A211302.
%K nonn
%O 2,1
%A _David W. Wilson_
%E Extended by _David W. Wilson_, using values from A211302
%E b-file from Wynn, 2013, added by _N. J. A. Sloane_, Nov 29 2013