id:A165633 - OEIS Search Results

Search: id:A165633

Displaying 1-1 of 1 results found.

page 1

Number of tatami-free rooms of given size A165632(n).

+0
7

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 4, 2, 1, 1, 1, 1, 3, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 4, 2, 1, 1, 1 (list; graph; listen)

	OFFSET	`1,14`
	COMMENT	`Number of rectangles of size A165632(n) which cannot be tiled with tatamis of size 1x2 such that not more than 3 tatamis meet at any point.`
	LINKS	`Project Euler, Problem 256: Tatami-Free Rooms, Sept. 2009.`
	FORMULA	`A165633 = #{ {r,c} \| rc = A165632(n) }.`
	EXAMPLE	`a(1)=1 because the rectangle of size 7x10 is the only one of size 70 that cannot be filled with 2x1 tiles without having 4 tiles meet in some point.` `a(237)=5 because there are 5 different rectangles of size A165632(237)=1320 which cannot be tiled in the given way.`
	CROSSREFS	`Cf. A068920.` `Sequence in context: A043280 A030379 A030392 this_sequence A117456 A030621 A120336` `Adjacent sequences: A165630 A165631 A165632 this_sequence A165634 A165635 A165636`
	KEYWORD	`nonn`
	AUTHOR	`M. F. Hasler (mhasler(AT)univ-ag.fr), Sep 26 2009`

page 1

Search completed in 0.002 seconds

Last modified November 25 13:47 EST 2009. Contains 167481 sequences.

AT&T Labs Research