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.

Showing 1-3 of 3 results.

A361001 Triangle read by rows: T(n,k) is the number of tilings of an n X k rectangle by integer-sided rectangular pieces that cannot be rearranged to produce a different tiling of the rectangle (except rotations and reflections of the original tiling), 1 <= k <= n.

Original entry on oeis.org

1, 2, 4, 3, 7, 9, 4, 11, 18, 23, 4, 14, 22, 34, 41, 6, 23, 42, 72, 108
Offset: 1

Views

Author

Pontus von Brömssen, Feb 28 2023

Keywords

Examples

			Triangle begins:
  n\k|  1  2  3  4   5  6
  ---+-------------------
  1  |  1
  2  |  2  4
  3  |  3  7  9
  4  |  4 11 18 23
  5  |  4 14 22 34  41
  6  |  6 23 42 72 108  ?
The T(3,3) = 9 nonrearrangeable tilings of the 3 X 3 square are:
  +---+---+---+   +---+---+---+   +---+---+---+
  |           |   |           |   |       |   |
  +           +   +---+---+---+   +---+---+---+
  |           |   |           |   |           |
  +           +   +           +   +           +
  |           |   |           |   |           |
  +---+---+---+   +---+---+---+   +---+---+---+
.
  +---+---+---+   +---+---+---+   +---+---+---+
  |   |   |   |   |       |   |   |   |   |   |
  +---+---+---+   +---+---+   +   +---+---+   +
  |           |   |       |   |   |       |   |
  +           +   +       +   +   +       +   +
  |           |   |       |   |   |       |   |
  +---+---+---+   +---+---+---+   +---+---+---+
.
  +---+---+---+   +---+---+---+   +---+---+---+
  |   |   |   |   |           |   |   |   |   |
  +---+---+---+   +---+---+---+   +---+---+---+
  |       |   |   |           |   |   |   |   |
  +       +---+   +---+---+---+   +---+---+---+
  |       |   |   |           |   |   |   |   |
  +---+---+---+   +---+---+---+   +---+---+---+

Crossrefs

Cf. A000005, A360629, A360998, A361002 (main diagonal), A361003 (first column), A361004 (second column), A361005 (third column).

Formula

T(n,1) = A361003(n) = A000005(n) + floor((n-1)/2). (The first term corresponds to cases where all pieces have the same size, the second to cases where there are two pieces of different sizes.)

A361000 Number of tilings of an n X 3 rectangle by integer-sided rectangular pieces that cannot be rearranged to produce a different tiling of the rectangle (including rotations and reflections of the original tiling).

Original entry on oeis.org

2, 3, 2, 4, 3, 5, 3, 6, 4, 6, 3, 9, 3, 6, 6, 8, 3, 9, 3, 10, 6, 6, 3, 13, 5, 6, 6, 10, 3, 13, 3, 10, 6, 6, 7, 15, 3, 6, 6, 14, 3, 13, 3, 10, 10, 6, 3, 17, 5, 10, 6, 10, 3, 13, 7, 14, 6, 6, 3, 21, 3, 6, 10, 12, 7, 13, 3, 10, 6, 14, 3, 21, 3, 6, 10, 10, 7, 13, 3
Offset: 1

Views

Author

Pontus von Brömssen, Feb 28 2023

Keywords

Links

Crossrefs

Third column of A360998.
Cf. A000005, A083039, A360632, A361005.

Programs

Formula

a(n) = 2*A000005(n) - A083039(n) for n >= 3.
Proof: (Start)
Note that a nonrearrangeable tiling must have full symmetry, otherwise it could be rotated or reflected to another tiling.
Identical pieces of size m X 1 tile the n X 3 rectangle in a unique way exactly when m is a divisor of n, except m = 2 and m = 3. Identical pieces of size m X 3 tile the rectangle in a unique way exactly when m is a divisor of n, except m = 1. The only other pieces that fit in the rectangle are of size m X 2, where m = 2 or m >= 4, but it is easily seen that the rectangle cannot be tiled with identical pieces of those sizes, so there are 2*A000005(n) - 1 - [n even] - [n divisible by 3] = 2*A000005(n) - A083039(n) nonrearrangeable tilings of the rectangle with identical pieces.
We now prove that there is no nonrearrangeble tiling of the rectangle that contains pieces of different sizes. Assume that we have such a tiling of the rectangle of height n and width 3, for the smallest possible value of n.
A fault of a tiling is a line through the interior of the rectangle that does not pass through the interior of any piece. If the tiling has any horizontal (or vertical) faults, all the resulting horizontal (or vertical) strips between the faults must have the same size and be tiled in the same way, otherwise the strips could be permuted to another tiling.
If the tiling has any vertical faults, there must be three identically tiled vertical n X 1 strips. This implies that a single strip must contain pieces of different lengths, which is clearly impossible because those pieces could be permuted to another tiling.
If there are no vertical faults, there must be a piece in the tiling with a horizontal side of length at least 2, and by symmetry one of its horizontal edges must be part of a horizontal fault, otherwise another tiling could be obtained by reflection. The resulting strips (of width 3) must all be tiled in the same way (and thus contain pieces of different sizes), and the tiling of one strip must be nonrearrangeble. We have thus obtained a nonrearrangeable tiling with pieces of different sizes for a smaller height, a contradiction.
(End)

A360999 Number of tilings of an n X 2 rectangle by integer-sided rectangular pieces that cannot be rearranged to produce a different tiling of the rectangle (including rotations and reflections of the original tiling).

Original entry on oeis.org

2, 2, 3, 4, 3, 6, 3, 6, 5, 6, 3, 10, 3, 6, 7, 8, 3, 10, 3, 10, 7, 6, 3, 14, 5, 6, 7, 10, 3, 14, 3, 10, 7, 6, 7, 16, 3, 6, 7, 14, 3, 14, 3, 10, 11, 6, 3, 18, 5, 10, 7, 10, 3, 14, 7, 14, 7, 6, 3, 22, 3, 6, 11, 12, 7, 14, 3, 10, 7, 14, 3, 22, 3, 6, 11, 10, 7, 14
Offset: 1

Views

Author

Pontus von Brömssen, Feb 28 2023

Keywords

Crossrefs

Second column of A360998.
Essentially the same as A086369.
Cf. A000005, A000035, A114003, A360631, A361004.

Formula

a(n) = 2*A000005(n) - 1 - [n even] = A114003(n) + A000035(n) - 1 for n >= 2.
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.