

A018835


Minimal number of smaller integersided squares that tile an n X n square.


3



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
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

2,1


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


REFERENCES

S. Kurz, Squaring the square with integer linear programming, http://www.wm.unibayreuth.de/fileadmin/Sascha/Publikationen2/square.pdf


LINKS

Ed Wynn, Table of n, a(n) for n = 2..126
Ed Wynn, Exhaustive generation of Mrs Perkins's quilt square dissections for low orders, 2013; arXiv:1308.5420


CROSSREFS

Cf. A211302.
Sequence in context: A084892 A245556 A256318 * A055166 A202243 A130762
Adjacent sequences: A018832 A018833 A018834 * A018836 A018837 A018838


KEYWORD

nonn,more,changed


AUTHOR

David W. Wilson


EXTENSIONS

Extended by David W. Wilson, using values from A211302
bfile from Wynn, 2013, added by N. J. A. Sloane, Nov 29 2013


STATUS

approved



