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.

Previous Showing 11-15 of 15 results.

A121194 Number of n-celled polyominoes, where the cells are 1 X 2 rectangles with one edge of length 2 replaced by a curved arc that either sags inwards or bulges outwards, subject to some restrictions.

Original entry on oeis.org

1, 2, 10, 84
Offset: 0

Views

Author

Keywords

Comments

This is the result of trying to infer the rules behind A056755. The match is not exact - these rules allow 16 3-celled polyominoes not allowed in A056755. However, the reason for the exclusion of those 16 polyominoes in A056755 is not clear.
The restrictions are: all curved edges must be on the boundary of the polyomino, each side of the polyomino must be either all curved, or all straight and if two cells meet on a side of length 2, they must share the whole side. Polyominoes are allowed to be rotated and reflected.
See the Applegate link for further information.

Crossrefs

A213377 Number of polyominoes of order 2n that can be tiled by dominoes in a unique way.

Original entry on oeis.org

1, 3, 20, 170, 1728, 18878, 214278, 2488176, 29356463
Offset: 1

Views

Author

Joseph Myers, Jun 10 2012

Keywords

Comments

Tilings related by a symmetry of the polyomino that is not a symmetry of the tiling count as distinct (thus, the square tetromino counts as being tiled in two distinct ways).

Crossrefs

A213378 Number of polyominoes of order 2n that can be tiled by dominoes in more than one way.

Original entry on oeis.org

0, 1, 3, 41, 499, 6946, 95964, 1330807, 18395673
Offset: 1

Views

Author

Joseph Myers, Jun 10 2012

Keywords

Comments

Tilings related by a symmetry of the polyomino that is not a symmetry of the tiling count as distinct (thus, the square tetromino counts as being tiled in two distinct ways).

Crossrefs

A056845 Number of distinct connected planar figures that can be formed from n non-overlapping diamonds.

Original entry on oeis.org

1, 2, 9, 41, 248, 1610, 11065, 78218, 563675, 4113988, 30329616, 225394071, 1686227909
Offset: 1

Views

Author

James Sellers, Aug 28 2000

Keywords

Comments

If you look at Vicher's picture of the 40 4-celled polydiamonds (link in A056844), near the middle of the picture is a polydiamond that looks like the traditional 2-D representation of a cube with an extra diamond stuck to the edge. Depending on how you orient the cube, there are actually 2 different ways to form this polydiamond, although there is no change in the perimeter shape. - Larry_Reeves(AT)intranetsolutions.com, Jun 22 2001; edited by Aaron N. Siegel, May 18 2022
Two figures are considered distinct even if their perimeter shapes are identical, provided their internal arrangements of diamonds are distinct (and not related by symmetry). This distinguishes the related sequence A056844 from A056845. The two sequences first diverge at n = 4. - Aaron N. Siegel, May 18 2022

Crossrefs

Extensions

Title clarified, a(6) corrected and a(7)-a(13) from Aaron N. Siegel, May 18 2022

A308437 Triangle read by rows: T(n,k) = number of ways, summed over the free n-ominoes, that an n-omino with an assigned orientation can be maximally (partially) covered by k X 1 tiles.

Original entry on oeis.org

1, 1, 1, 2, 4, 1, 5, 8, 4, 1, 12, 35, 18, 4, 1, 35, 89, 61, 22, 5, 1, 108, 425, 206, 97, 28, 5, 1, 369, 1438, 739, 436, 141, 36, 6, 1, 1285, 6818, 3008, 1853, 687, 193, 44, 6, 1, 4655, 27713, 12823, 7668, 3233, 1039, 268, 54, 7, 1, 17073, 125830, 51619, 30902, 14731, 5164, 1518, 351, 64, 7, 1
Offset: 1

Views

Author

R. J. Mathar, May 27 2019

Keywords

Comments

Null tilings (no k X 1 tiles at all) are not counted. Peter Munn, May 30 2019
There are A000105(n) free n-ominoes. In a loop over all of them, first consider one fixed representative.
Consider the straight k-ominoes (in horizontal or vertical alignments commensurate with the grid of the n-omino), and let c(i,n,k) be the maximum number of straight k-ominoes in any mixture of vertical-horizontal alignments that can be placed inside the i-th n-omino such that no k-ominoes overlap and such that all cells of the k-ominoes are cells of the n-omino.
Obviously c(i,n,k) <= floor(n/k): The coverage by a set of fixed k-ominoes is always incomplete if k is not a divisor of n.
Count all configurations with the number of c(i,n,k) k-ominos in the representative. Configurations with distinct multisets of k-ominoes are considered distinct, even if rotations or flips of the (partially) covered n-omino may exist that map these onto others.
T(n,k) is the number of (partial) tilings of the free n-ominoes with c(i,n,k) straight k-ominoes.

Examples

			The triangle starts with n >= 1, 1 <= k <= n as follows:
  1;
  1, 1;
  2, 4, 1;
  5, 8, 4, 1;
  12, 35, 18, 4, 1;
  35, 89, 61, 22, 5, 1;
  108, 425, 206, 97, 28, 5, 1;
  369, 1438, 739, 436, 141, 36, 6, 1;
  1285, 6818, 3008, 1853, 687, 193, 44, 6, 1;
  (...)
From _M. F. Hasler_ and _R. J. Mathar_, May 27 2019: (Start)
We have T(n,1) = A000105(n) which is the number of different inequivalent n-ominoes, and each one can be maximally filled in exactly one (trivial) way with 1 X 1 monominoes.
We have T(n,n) = 1 because only the straight n X 1 polyomino can be filled in the required way, namely with only straight n-ominoes.
T(3,2) = 4 counts 2 ways of placing a domino into the straight tromino (the two ends of the tromino considered distinct) and 2 ways of placing a domino into the L-tromino (again the two variants obtained by flipping along the diagonal considered distinct). (End)
		

Crossrefs

Formula

T(n,1) = A000105(n).
T(n,n) = 1.

Extensions

NAME improved, Peter Munn, May 30 2019
Previous Showing 11-15 of 15 results.