|
Search: id:A068922
|
|
|
| A068922 |
|
Number of ways to tile a 3 X 2n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point. |
|
+0
7
|
|
| 3, 4, 6, 10, 16, 26, 42, 68, 110, 178, 288, 466, 754, 1220, 1974, 3194, 5168, 8362, 13530, 21892, 35422, 57314, 92736, 150050, 242786, 392836, 635622, 1028458, 1664080, 2692538, 4356618, 7049156, 11405774, 18454930, 29860704, 48315634
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
For n >= 2, a(n) = 2*F(n+1), where F(n)=A000045(n) is the n-th Fibonacci number.
G.f.: x*(x^2-x-3)/(x^2+x-1) [From Maksym Voznyy (voznyy(AT)mail.ru), Aug 11 2009]
|
|
CROSSREFS
|
Cf. A068928 for incongruent tilings, A068920 for more info.
Essentially the same as A006355.
Sequence in context: A114736 A099417 A139463 this_sequence A032408 A018908 A052548
Adjacent sequences: A068919 A068920 A068921 this_sequence A068923 A068924 A068925
|
|
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.
|
|
|
Search completed in 0.002 seconds
|
