%I A068925
%S A068925 1,9,6,3,2,2,2,1,1,2,3,4,3,3,3,4,6,6,7,6,7,9,10,13,12,14,15,17,22,22,
%T A068925 27,27,31,37,39,49,49,58,64,70,86,88,107,113,128,150,158,193,201,235,
%U A068925 263,286,343,359,428,464,521,606,645,771,823,949,1070,1166,1377,1468
%N A068925 Number of ways to tile a 6 X n room with 1x2 Tatami mats. At most 3 Tatami 
               mats may meet at a point.
%C A068925 For n >= 12, a(n) = a(n-5) + a(n-7).
%F A068925 G.f.: x*(1-2*x^10-6*x^9-11*x^8-6*x^7-7*x^6+x^5+2*x^4+3*x^3+6*x^2+9*x)/
               (1-x^7-x^5) [From Maksym Voznyy (voznyy(AT)mail.ru), Aug 11 2009]
%Y A068925 Cf. A068931 for incongruent tilings, A068920 for more info.
%Y A068925 Sequence in context: A011219 A019961 A093540 this_sequence A019683 A020759 
               A099817
%Y A068925 Adjacent sequences: A068922 A068923 A068924 this_sequence A068926 A068927 
               A068928
%K A068925 easy,nonn
%O A068925 1,2
%A A068925 Dean Hickerson (dean.hickerson(AT)yahoo.com), Mar 11 2002
%E A068925 G.f. proposed by Maksym Voznyy checked and corrected by R. J. Mathar, 
               Sep 16 2009.