A335242 - OEIS

A335242

a(n) = 2*a(n-1) + a(n-3) for n >= 4, with initial values a(0) = 1, a(1) = 0, a(2) = 2, and a(3) = 3.

1, 0, 2, 3, 6, 14, 31, 68, 150, 331, 730, 1610, 3551, 7832, 17274, 38099, 84030, 185334, 408767, 901564, 1988462, 4385691, 9672946, 21334354, 47054399, 103781744, 228897842, 504850083, 1113481910, 2455861662, 5416573407, 11946628724, 26349119110, 58114811627

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

COMMENTS

a(n) is the number of ways to tile this 2 X n strip (with one extra square added at the top left) with dominoes and L-shaped trominoes (also called polyominoes):

|_|_ _ _ _

|_|_|_|_|_| . . .

LINKS

Table of n, a(n) for n=0..33.

Index entries for linear recurrences with constant coefficients, signature (2,0,1).

FORMULA

a(n) = 2*a(n-1) + a(n-3) for n >= 4.

a(n) = A008998(n-2) + A052980(n-2) for n >= 2.

G.f.: (2*x^3-2*x^2+2*x-1)/(x^3+2*x-1).

EXAMPLE

a(2) = 2 thanks to the following two tilings (where the L-shaped trominoes are tiled with X's and the dominoes are left blank):

._ _