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.

A361220 Maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X 4 rectangle.

Original entry on oeis.org

3, 29, 370, 5752, 82310, 1232770, 19119198, 307914196, 5020522468, 89323885136, 1708142066600
Offset: 1

Views

Author

Pontus von Brömssen, Mar 05 2023

Keywords

Comments

Tilings that are rotations or reflections of each other are considered distinct.

Examples

			The following table shows the sets of pieces that give the maximum number of tilings for n <= 11. All these sets are unique.
    \     Number of pieces of size
   n \  1 X 1 | 1 X 2 | 1 X 3 | 1 X 4
  ----+-------+-------+-------+------
   1  |   2   |   1   |   0   |   0
   2  |   4   |   2   |   0   |   0
   3  |   3   |   3   |   1   |   0
   4  |   5   |   4   |   1   |   0
   5  |   7   |   5   |   1   |   0
   6  |   8   |   5   |   2   |   0
   7  |  10   |   6   |   2   |   0
   8  |  10   |   8   |   2   |   0
   9  |  11   |   8   |   3   |   0
  10  |  11   |   8   |   3   |   1
  11  |  13   |   9   |   3   |   1
		

Crossrefs

Fourth column of A361216.