id:A036444 - OEIS Search Results

Search: id:A036444

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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; listen)

	OFFSET	`2,1`
	LINKS	`E. J. Friedman, Integer Square Tilings`
	EXAMPLE	`a(7)=3 since any tiling of a 7x7 square with integer squares has at least 3 of the same size.`
	CROSSREFS	`Cf. A036444.` `Sequence in context: A161811 A016717 A031349 this_sequence A125583 A063694 A068901` `Adjacent sequences: A036441 A036442 A036443 this_sequence A036445 A036446 A036447`
	KEYWORD	`hard,nonn`
	AUTHOR	`Erich Friedman (erich.friedman(AT)stetson.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research