A036444 - OEIS

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

(list; graph; refs; listen; history; text; internal format)

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.