login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 2
1, 1, 171, 1037, 48605, 550969, 16231655, 242436361, 5811552169, 99314257745, 2155420214569, 39424864309289, 814300033798553, 15418987976034589, 310609546719927905, 5986274269170524449, 119070864662878688121, 2315588762204123710545, 45762166856599268084337 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..300

S. Butler and S. Osborne, Counting tilings by taking walks, 2012.

CROSSREFS

Cf. A063652, A220870.

Sequence in context: A031691 A158220 A079654 * A251329 A221754 A036518

Adjacent sequences:  A220866 A220867 A220868 * A220870 A220871 A220872

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Dec 27 2012

EXTENSIONS

More terms from Alois P. Heinz, Jun 06 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 04:06 EST 2021. Contains 340262 sequences. (Running on oeis4.)