The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068924 Number of ways to tile a 5 X 2n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point. 5
6, 3, 2, 2, 4, 4, 6, 8, 10, 14, 18, 24, 32, 42, 56, 74, 98, 130, 172, 228, 302, 400, 530, 702, 930, 1232, 1632, 2162, 2864, 3794, 5026, 6658, 8820, 11684, 15478, 20504, 27162, 35982, 47666, 63144, 83648, 110810, 146792, 194458, 257602, 341250 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
R. J. Mathar, Paving rectangular regions with rectangular tiles,...., arXiv:1311.6135 [math.CO], Table 4.
F. Ruskey and J. Woodcock, Counting Fixed-Height Tatami Tilings, Electronic Journal of Combinatorics, Paper R126 (2009) 20 pages.
FORMULA
For n >= 6, a(n) = a(n-2) + a(n-3).
G.f.: x*(-6+x^4+7*x^3+4*x^2-3*x)/(-1+x^3+x^2). [Maksym Voznyy (voznyy(AT)mail.ru), Aug 11 2009; checked and corrected by R. J. Mathar, Sep 16 2009]
a(n) = 2*A000931(n+3) for n>=3. - R. J. Mathar, Dec 06 2013
CROSSREFS
Cf. A068930 for incongruent tilings, A068920 for more info. First column of A272474.
Sequence in context: A033326 A068996 A362871 * A106224 A254571 A360562
KEYWORD
easy,nonn
AUTHOR
Dean Hickerson, Mar 11 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 14 17:00 EDT 2024. Contains 372533 sequences. (Running on oeis4.)