id:A068923 - OEIS Search Results

Search: id:A068923

Displaying 1-1 of 1 results found.

page 1

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

+0
3

1, 4, 4, 2, 3, 3, 3, 5, 5, 6, 8, 8, 11, 13, 14, 19, 21, 25, 32, 35, 44, 53, 60, 76, 88, 104, 129, 148, 180, 217, 252, 309, 365, 432, 526, 617, 741, 891, 1049, 1267, 1508, 1790, 2158, 2557, 3057, 3666, 4347, 5215, 6223, 7404, 8881, 10570, 12619, 15104, 17974 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`For n >= 9, a(n) = a(n-3) + a(n-5).`
	CROSSREFS	`Cf. A068929 for incongruent tilings, A068920 for more info.` `Adjacent sequences: A068920 A068921 A068922 this_sequence A068924 A068925 A068926` `Sequence in context: A002581 A099655 A031351 this_sequence A103714 A112108 A021230`
	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 6 12:54 EDT 2008. Contains 144667 sequences.

AT&T Labs Research