A211302 - OEIS

A211302

Minimal number of smaller integer-sided squares that tile a p X p square, where p = n-th prime.

%I #15 Oct 12 2020 11:15:19

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

%T 19,19,19,19,19,19

%N Minimal number of smaller integer-sided squares that tile a p X p square, where p = n-th prime.

%H Sasha Kurz, <a href="https://eref.uni-bayreuth.de/3272/">Squaring the square with integer linear programming</a>.

%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. A000040, A018835.

%K nonn,more

%O 1,1

%A _N. J. A. Sloane_, Apr 07 2012

%E More terms from Wynn, 2013. - _N. J. A. Sloane_, Nov 29 2013