id:A068925 - OEIS Search Results

Search: id:A068925

Displaying 1-1 of 1 results found.

page 1

Number of ways to tile a 6 X n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.

+0
3

1, 9, 6, 3, 2, 2, 2, 1, 1, 2, 3, 4, 3, 3, 3, 4, 6, 6, 7, 6, 7, 9, 10, 13, 12, 14, 15, 17, 22, 22, 27, 27, 31, 37, 39, 49, 49, 58, 64, 70, 86, 88, 107, 113, 128, 150, 158, 193, 201, 235, 263, 286, 343, 359, 428, 464, 521, 606, 645, 771, 823, 949, 1070, 1166, 1377, 1468 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`For n >= 12, a(n) = a(n-5) + a(n-7).`
	FORMULA	`G.f.: x(1-2x^10-6x^9-11x^8-6x^7-7x^6+x^5+2x^4+3x^3+6x^2+9x)/(1-x^7-x^5) [From Maksym Voznyy (voznyy(AT)mail.ru), Aug 11 2009]`
	CROSSREFS	`Cf. A068931 for incongruent tilings, A068920 for more info.` `Sequence in context: A011219 A019961 A093540 this_sequence A019683 A020759 A099817` `Adjacent sequences: A068922 A068923 A068924 this_sequence A068926 A068927 A068928`
	KEYWORD	`easy,nonn`
	AUTHOR	`Dean Hickerson (dean.hickerson(AT)yahoo.com), Mar 11 2002`
	EXTENSIONS	`G.f. proposed by Maksym Voznyy checked and corrected by R. J. Mathar, Sep 16 2009.`

page 1

Search completed in 0.002 seconds

Last modified December 21 10:15 EST 2009. Contains 171081 sequences.

AT&T Labs Research