This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A068930 Number of incongruent ways to tile a 5 X 2n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point. 3
 4, 2, 1, 1, 1, 2, 2, 3, 3, 5, 5, 8, 9, 13, 15, 22, 26, 37, 45, 63, 78, 108, 136, 186, 237, 322, 414, 559, 724, 973, 1267, 1697, 2219, 2964, 3888, 5183, 6815, 9071, 11949, 15886, 20955, 27835, 36755, 48790, 64476, 85545, 113115, 150021, 198460, 263136 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA For n >= 12, a(n) = a(n-2) + a(n-3) + a(n-4) - a(n-7) - a(n-8) - a(n-9). G.f.: x*(4+x^10+5*x^9+4*x^8+3*x^7-x^6-2*x^5-6*x^4-5*x^3 -3*x^2+2*x) / ((x^3+x^2-1)*(x^6+x^4-1)). - Maksym Voznyy (voznyy(AT)mail.ru), Aug 11 2009 CROSSREFS Cf. A068924 for total number of tilings, A068926 for more info. Cf. A005683. Sequence in context: A033324 A016508 A010312 * A204815 A144260 A036466 Adjacent sequences:  A068927 A068928 A068929 * A068931 A068932 A068933 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. STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .