cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A063654 Number of ways to tile a 10 X n rectangle with 1 X 1 and 2 X 2 tiles.

Original entry on oeis.org

1, 1, 89, 683, 16717, 221799, 4005785, 61643709, 1029574631, 16484061769, 269718819131, 4364059061933, 71019435701025, 1152314664726905, 18725412666911121, 304052089851133193, 4939032362569285343
Offset: 0

Views

Author

Reiner Martin, Jul 23 2001

Keywords

Crossrefs

Column k=10 of A245013.

Formula

a(n) = 11a(n-1) + 195a(n-2) - 1459a(n-3) - 10427a(n-4) + 79002a(n-5) + 188873a(n-6) - 1922453a(n-7) - 522744a(n-8) + 21726132a(n-9) - 11085988a(n-10) - 137059276a(n-11) + 114023550a(n-12) + 533938164a(n-13) - 503739499a(n-14) - 1345858084a(n-15) + 1272444796a(n-16) + 2223076291a(n-17) - 1997887777a(n-18) - 2382027317a(n-19) + 2015253425a(n-20) + 1613022647a(n-21) - 1309632545a(n-22) - 660948344a(n-23) + 533727589a(n-24) + 152685069a(n-25) - 128889883a(n-26) - 17772195a(n-27) + 16954690a(n-28) + 883980a(n-29) - 1089264a(n-30) - 11392a(n-31) + 26112a(n-32) - Keith Schneider (kschneid(AT)bulldog.unca.edu), Apr 02 2006