id:A068931 - OEIS Search Results

Search: id:A068931

Displaying 1-1 of 1 results found.

page 1

Number of incongruent 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, 6, 2, 2, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 4, 4, 4, 4, 5, 6, 7, 7, 8, 8, 10, 12, 13, 14, 15, 17, 20, 21, 26, 26, 31, 34, 38, 44, 47, 56, 60, 66, 78, 82, 100, 104, 122, 134, 148, 176, 186, 217, 238, 266, 310, 328, 393, 417, 483, 543, 594, 694, 745, 870, 960, 1066, 1237 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`For n >= 28, a(n) = a(n-5) + a(n-7) + a(n-10) + a(n-14) - a(n-15) - a(n-17) - a(n-19) - a(n-21).`
	CROSSREFS	`Cf. A068925 for total number of tilings, A068926 for more info.` `Adjacent sequences: A068928 A068929 A068930 this_sequence A068932 A068933 A068934` `Sequence in context: A110321 A111553 A141473 this_sequence A061666 A136708 A020795`
	KEYWORD	`easy,nonn`
	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