OFFSET
0,2
COMMENTS
a(n) is the number of ways to tile a 2 X n board with squares, dominoes, and L-shaped quadrominoes. Here is one of the a(4)=109 possible tilings of a 2 X 4 board:
_______
| | |_|_|
|_|_____|
Compare to A030186 which counts the tilings with just squares and dominos.
LINKS
Index entries for linear recurrences with constant coefficients, signature (3,1,7,-2).
FORMULA
a(n) = 3*a(n-1) + a(n-2) + 7*a(n-3) - 2*a(n-4).
a(n) = A030186(n) + 2*Sum_{i=0..n-3} (A033505(n-i-3)*a(i) + A030186(n-i-3)*(a(i)+2*Sum_{j=0..i} a(j))).
a(n) ~ (2 + sqrt(3))^(n+2) / (18 + 4*sqrt(3)). - Vaclav Kotesovec, Aug 21 2025
MATHEMATICA
LinearRecurrence[{3, 1, 7, -2}, {1, 2, 7, 30}, 30]
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Greg Dresden and Madison Lingchen Zhou, Aug 20 2025
STATUS
approved
