A220869 - OEIS

A220869

Number of ways to tile an 8 X n rectangle with 1 X 2 and 2 X 2 tiles (i.e., dominoes and squares).

%I #12 Nov 28 2016 00:36:11

%S 1,1,171,1037,48605,550969,16231655,242436361,5811552169,99314257745,

%T 2155420214569,39424864309289,814300033798553,15418987976034589,

%U 310609546719927905,5986274269170524449,119070864662878688121,2315588762204123710545,45762166856599268084337

%N Number of ways to tile an 8 X n rectangle with 1 X 2 and 2 X 2 tiles (i.e., dominoes and squares).

%H Alois P. Heinz, <a href="/A220869/b220869.txt">Table of n, a(n) for n = 0..300</a>

%H S. Butler and S. Osborne, <a href="http://orion.math.iastate.edu/butler/papers/14_02_walks.pdf">Counting tilings by taking walks</a>, 2012.

%Y Cf. A063652, A220870.

%K nonn

%O 0,3

%A _N. J. A. Sloane_, Dec 27 2012

%E More terms from _Alois P. Heinz_, Jun 06 2013