OFFSET
0,1
COMMENTS
The number of Tatami Tilings of the 3 X (2n+1) floor with one monomer at an arbitrary place (and therefore 3n+1 dimers).
The sequence is an overlay of the sequence b(n) = 1, 4, 7, 14, 26,... with g.f. B(x) = x*(1+2*x^2-2*x^4-2*x^6) / (1-x^2-x^4)^2 and the sequence c(n) = 0, 2, 4, 10, 20,... with g.f. C(x) = 2*x^3/(1-x^2-x^4)^2, meaning a(n) = 2*b(n)+c(n) = 2, 10, 18, 38, 72.... The sequence b(n) counts the tatami tilings with one monomer that must be in the first of the three lanes of the 3Xn grid. The sequence c(n) counts the tatami tilings with one monomer that must be in the middle lane of the grid. By up-down symmetry b(n) counts also the tatami tilings with one monomer that must be in the last of the three lanes. - R. J. Mathar, May 03 2016
LINKS
R. J. Mathar, Re: tatami, SeqFan List of March 2016.
Index entries for linear recurrences with constant coefficients, signature (2,1,-2,-1).
MATHEMATICA
LinearRecurrence[{2, 1, -2, -1}, {2, 10, 18, 38}, 34] (* Jean-François Alcover, Aug 08 2023 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
R. J. Mathar, Apr 14 2016
STATUS
approved