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.

A353964 Number of tilings of a 2 X n rectangle using 2 X 2 and 1 X 1 tiles and right trominoes.

Original entry on oeis.org

1, 1, 6, 13, 45, 122, 373, 1073, 3182, 9293, 27349, 80178, 235509, 691097, 2028998, 5955501, 17482685, 51318186, 150642613, 442198913, 1298048350, 3810328141, 11184967717, 32832705122, 96378199989, 282911661033, 830468071222, 2437782776365, 7155946454541
Offset: 0

Views

Author

Gerhard Kirchner, May 13 2022

Keywords

Comments

For tiling algorithm see A351322.

Examples

			a(3)=13, see example 3 X 2, A353965.
		

Crossrefs

Programs

Formula

G.f.: 1 / (1 - x - 5*x^2 - 2*x^3).
a(n) = a(n-1) + 5*a(n-2) + 2*a(n-3).