id:A068926 - OEIS Search Results

Search: id:A068926

Displaying 1-1 of 1 results found.

page 1

Table of ti(r,s) by diagonals, where ti(r,s) is the number of incongruent ways to tile an r X s room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.

+0
8

0, 1, 1, 0, 1, 0, 1, 2, 2, 1, 0, 3, 0, 3, 0, 1, 4, 2, 2, 4, 1, 0, 6, 0, 1, 0, 6, 0, 1, 8, 2, 2, 2, 2, 8, 1, 0, 12, 0, 2, 0, 2, 0, 12, 0, 1, 16, 4, 2, 1, 1, 2, 4, 16, 1, 0, 24, 0, 3, 0, 1, 0, 3, 0, 24, 0, 1, 33, 5, 3, 1, 1, 1, 1, 3, 5, 33, 1, 0, 49, 0, 4, 0, 1, 0, 1, 0, 4, 0, 49, 0, 1, 69, 9, 5, 1, 1 (list; table; graph; listen)

	OFFSET	`0,8`
	COMMENT	`Table begins: ti(1,1); ti(1,2) ti(2,1); ti(1,3) ti(2,2) ti(3,1); ... Rows 2-6 are given in A068927 - A068931.`
	LINKS	`Dean Hickerson, Filling rectangular rooms with Tatami mats`
	MATHEMATICA	`See link above for Mathematica programs.`
	CROSSREFS	`Cf. A068920 for total number of tilings, A052270 for count by area, A068927 for row 2, A068928 for row 3, A068929 for row 4, A068930 for row 5, A068931 for row 6.` `Sequence in context: A029337 A060086 A062135 this_sequence A146527 A063250 A107424` `Adjacent sequences: A068923 A068924 A068925 this_sequence A068927 A068928 A068929`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Dean Hickerson (dean.hickerson(AT)yahoo.com), Mar 11 2002`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research