cp's OEIS Frontend

The values for n>28 were produced by a set of programs, the most difficult of which is attached. There is no guarantee that the values are correct, although presumably Shirakawa has calculated them through a(45). The attached program can be altered to count only achiral polyominoes, and those results match those of A142886, which uses a very different method. The difficulties lie in determining each inner loop (A324408 and A324409) and in determining connections within the inner loop (bad_connection subroutine). The last bug I found in the program affected only polyominoes with 72 or more cells. - Robert A. Russell, May 23 2020

These are polyominoes of the regular tiling with Schläfli symbol {4,4}. In late August, 2021, John Mason informed me that there were errors for a(44) and higher. My error in a(44) was a copying error, but later entries were wrong because of my programming errors. After making corrections (see attached C++ program), our values now match. John uses a unique calculation of his own devising. Since it is quite different from Redelmeier's inner rings, the match gives us some confidence in the current values. - Robert A. Russell, Nov 01 2021

Polyominoes with precisely 90-degree symmetry centered about square centers and vertices are enumerated by A351142 and A234007 respectively. - John Mason, Feb 17 2022

Chessboard-colored polyominoes, considering to be distinct two shapes that cannot be mapped onto each other by any form of symmetry. For example, there are two distinct monominoes, one black, one white. There is only one domino, with one black square, and one white. - John Mason, Nov 25 2013

The number of free polyominoes of size 2n that have 180-degree rotational symmetry about a point that coincides with the midpoint of a side a square, and that have not at the same time any reflective symmetry. Note that for polyominoes which have a hole in the center, the center of rotation will be the midpoint of a side of a square within the hole, rather than being the midpoint of a side of a square of the polyomino itself. The sequence is defined for 2n rather than n as odd-sized polyominoes cannot have the required symmetry.

The sequence enumerates a subset of the polyominoes enumerated by A006747.

The number of free polyominoes of size 2n that have reflectional symmetry on a horizontal or vertical axis that coincides with the edges of some of the squares. The sequence is defined for 2n rather than n as odd-sized polyominoes cannot have the required symmetry.

Consider the tiling of the plane with squares of two different sizes as seen for example in Fig. 2.4.2(g) of Grünbaum and Shephard, p. 74. Sequence gives the number of "n-PairSquares", that is, polyominoes or animals that can be formed on this tiling from "n big or little squares, where the conjunction between two squares must involve an entire edge at least". - Original description (N. J. A. Sloane, Aug 17 2006, with quote from Livio Zucca's site)

Also counts one-sided polyominoes cut from an infinite chessboard with the usual coloring (big and little squares in Fig. 2.4.2(g) of Grünbaum and Shephard are equivalent to the two colors on a chessboard, and ignoring connections that are not a whole edge of one square means the connectivity is also equivalent); see Myers link regarding difference from A001071 for even terms a(6) onwards. - Joseph Myers, Oct 01 2011

The number of free polyominoes of size 4n that have 90-degree rotational symmetry about a point that coincides with the corner of a square, independently of any other symmetries. Note that for polyominoes which have a hole in the center, the center of rotation will be the corner of a square within the hole, rather than being the corner of a square of the polyomino itself. The sequence is defined for 4n rather than n as polyominoes of size not multiple of 4 cannot have the required symmetry.

The number of free polyominoes of size 2n that have 180-degree rotational symmetry about a point that coincides with the midpoint of a side a square, independently of any reflective symmetry. Note that for polyominoes which have a hole in the center, the center of rotation will be the midpoint of a side of a square within the hole, rather than being the midpoint of a side of a square of the polyomino itself. The sequence is defined for 2n rather than n as odd-sized polyominoes cannot have the required symmetry.

Each number becomes a palindrome by changing three digits.

Two polyominoes cut from a chessboard are considered the same for this sequence if the shapes of the polyominoes are related by a rotation or translation, and the colorings are related by any symmetry including a reflection. - Joseph Myers, Oct 01 2011