id:A068921 - OEIS Search Results

Search: id:A068921

Displaying 1-1 of 1 results found.

page 1

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

+0
6

1, 2, 3, 4, 6, 9, 13, 19, 28, 41, 60, 88, 129, 189, 277, 406, 595, 872, 1278, 1873, 2745, 4023, 5896, 8641, 12664, 18560, 27201, 39865, 58425, 85626, 125491, 183916, 269542, 395033, 578949, 848491, 1243524, 1822473, 2670964, 3914488, 5736961 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(n) = A000930(n+4).`
	FORMULA	`For n >= 4, a(n) = a(n-1) + a(n-3).`
	CROSSREFS	`Cf. A068927 for incongruent tilings, A068920 for more info.` `Cf. A078012.` `Sequence in context: A017825 A017826 A000930 this_sequence A078012 A135851 A101913` `Adjacent sequences: A068918 A068919 A068920 this_sequence A068922 A068923 A068924`
	KEYWORD	`easy,nonn`
	AUTHOR	`Dean Hickerson (dean(AT)math.ucdavis.edu), Mar 11 2002`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research