id:A060312 - OEIS Search Results

Search: id:A060312

Displaying 1-1 of 1 results found.

page 1

Number of distinct ways to cover a 2xn rectangle with dominoes (solutions are identified if they are rotations or reflections of each other).

+0
4

1, 1, 2, 4, 5, 9, 12, 21, 30, 51, 76, 127, 195, 322, 504, 826, 1309, 2135, 3410, 5545, 8900, 14445, 23256, 37701, 60813, 98514, 159094, 257608, 416325, 673933, 1089648, 1763581, 2852242, 4615823, 7466468, 12082291, 19546175, 31628466 (list; graph; listen)

	OFFSET	`1,3`
	FORMULA	`If F(n) is the n-th Fibonacci number, then a(2n)=(F(2n)+F(n+1))/2 and a(2n+1)=(F(2n+1)+F(n))/2 for n>1.`
	EXAMPLE	`a(3)=2 because of the configurations \|= and \|\|\|`
	CROSSREFS	`Essentially same as A001224, which is the main entry for this sequence.` `Sequence in context: A039898 A083690 A144121 this_sequence A068372 A068370 A060167` `Adjacent sequences: A060309 A060310 A060311 this_sequence A060313 A060314 A060315`
	KEYWORD	`easy,nonn`
	AUTHOR	`Thomas Ward (t.ward(AT)uea.ac.uk), Mar 27 2001`

page 1

Search completed in 0.002 seconds

Last modified November 23 10:40 EST 2009. Contains 167421 sequences.

AT&T Labs Research