A036444 Integer-sided squares, no more than a(n) of any size, can tile the square with side n.

4, 5, 4, 4, 4, 3, 4, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2

Offset

2,1

Comments

Eves (2001) illustrates that a(175) = 1. - Alonso del Arte, Jun 17 2013

References

Howard Eves, Mathematical Reminiscences. Mathematical Association of America (2001) p. 78 Fig. 7.

Links

Table of n, a(n) for n=2..100.

Erich J. Friedman, Integer Square Tilings

Example

a(7) = 3 since any tiling of a 7 X 7 square with integer squares has at least 3 of the same size.

Crossrefs

Cf. A036444.

Sequence in context: A366153 A031349 A200605 * A329505 A125583 A196619

Adjacent sequences: A036441 A036442 A036443 * A036445 A036446 A036447

Keyword

hard,nonn

Author

Erich Friedman

Status

approved