id:A068920 - OEIS Search Results

Search: id:A068920

Displaying 1-1 of 1 results found.

page 1

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

+0
9

0, 1, 1, 0, 2, 0, 1, 3, 3, 1, 0, 4, 0, 4, 0, 1, 6, 4, 4, 6, 1, 0, 9, 0, 2, 0, 9, 0, 1, 13, 6, 3, 3, 6, 13, 1, 0, 19, 0, 3, 0, 3, 0, 19, 0, 1, 28, 10, 3, 2, 2, 3, 10, 28, 1, 0, 41, 0, 5, 0, 2, 0, 5, 0, 41, 0, 1, 60, 16, 5, 2, 2, 2, 2, 5, 16, 60, 1, 0, 88, 0, 6, 0, 1, 0, 1, 0, 6, 0, 88, 0, 1, 129, 26 (list; table; graph; listen)

	OFFSET	`0,5`
	COMMENT	`Table begins: t(1,1); t(1,2) t(2,1); t(1,3) t(2,2) t(3,1); ... Rows 2-6 are given in A068921 - A068925.`
	LINKS	`Dean Hickerson, Filling rectangular rooms with Tatami mats`
	MATHEMATICA	`See link for Mathematica programs.`
	CROSSREFS	`Cf. A068926 for incongruent tilings, A067925 for count by area, A068921 for row 2, A068922 for row 3, A068923 for row 4, A068924 for row 5, A068925 for row 6.` `Adjacent sequences: A068917 A068918 A068919 this_sequence A068921 A068922 A068923` `Sequence in context: A089112 A139600 A103438 this_sequence A099390 A124031 A049600`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Dean Hickerson (dean(AT)math.ucdavis.edu), Mar 11 2002`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research