A346800 -id:A346800 - cp's OEIS frontend

A142886 Number of polyominoes with n cells that have the symmetry group D_8.

1, 1, 0, 0, 1, 1, 0, 0, 1, 2, 0, 0, 3, 2, 0, 0, 5, 4, 0, 0, 12, 7, 0, 0, 20, 11, 0, 0, 45, 20, 0, 0, 80, 36, 0, 0, 173, 65, 0, 0, 310, 117, 0, 0, 664, 216, 0, 0, 1210, 396, 0, 0, 2570, 736, 0, 0, 4728, 1369, 0, 0, 9976, 2558, 0, 0, 18468, 4787, 0, 0, 38840

Offset: 0

N. J. A. Sloane, Jan 01 2009

nonn

This is the largest possible symmetry group that a polyomino can have.

Polyominoes with such symmetry centered about square centers and vertices are enumerated by A351127 and A346800 respectively. - John Mason, Feb 16 2022

			The monomino has eight-fold symmetry. The tetromino with eight-fold symmetry is four cells in a square. The pentomino with eight-fold symmetry is a cell and its four adjacent cells.

Robert A. Russell, Table of n, a(n) for n = 0..163
Tomás Oliveira e Silva, Enumeration of polyominoes
D. H. Redelmeier, Counting polyominoes: yet another attack, Discrete Math., 36 (1981), 191-203.
D. H. Redelmeier, Table 3 of Counting polyominoes...
Index entries for sequences related to groups

Sequences classifying polyominoes by symmetry group: A000105, A006746, A006747, A006748, A006749, A056877, A056878, A142886, A144553, A144554, A351127, A346800.

Cf. A376971 (polycubes with full symmetry).

a(n) = A351127(n) + A346800(n/4) if n is a multiple of 4, otherwise a(n) = A351127(n). - John Mason, Feb 16 2022

Name corrected by Wesley Prosser, Sep 06 2017
a(28) added by Andrew Howroyd, Dec 04 2018
More terms from Robert A. Russell, Jan 13 2019

A006748 Number of diagonally symmetric polyominoes with n cells.

Original entry on oeis.org

0, 0, 1, 0, 2, 2, 7, 5, 26, 22, 91, 79, 326, 301, 1186, 1117, 4352, 4212, 16119, 15849, 60174, 60089, 226146, 228426, 854803, 872404, 3247207, 3342579, 12389106, 12850662, 47448984, 49544820, 182338754, 191529007, 702807040, 742163178, 2716205709, 2882119756

Offset: 1

N. J. A. Sloane

nonn

This sequence counts polyominoes with exactly the symmetry group of order 2 generated by a single reflection about a diagonal.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

John Mason, Table of n, a(n) for n = 1..50 (terms up to a(47) from Robert A. Russell)
Tomás Oliveira e Silva, Enumeration of polyominoes
D. H. Redelmeier, Counting polyominoes: yet another attack, Discrete Math., 36 (1981), 191-203.
D. H. Redelmeier, Table 3 of Counting polyominoes...
Toshihiro Shirakawa, Harmonic Magic Square, pp 3-4: Enumeration of Polyominoes considering the symmetry, April 2012.

Cf. A000105, A001168, A006746, A056877, A006748, A056878, A006747.

Sequences classifying polyominoes by symmetry group: A000105, A006746, A006747, A006748, A006749, A056877, A056878, A142886, A144553, A144554.

a(n) = (A346800(n) - A142886(n)) / 2 - A056878(n). - Robert A. Russell, Aug 25 2021

Extended to n=28 by Tomás Oliveira e Silva

A030227 Number of achiral polyominoes with n cells.

Original entry on oeis.org

1, 1, 1, 2, 3, 6, 10, 20, 34, 70, 121, 250, 441, 912, 1630, 3375, 6092, 12624, 22961, 47616, 87136, 180811, 332549, 690398, 1275166, 2648422, 4909364, 10199792, 18966700, 39416488, 73497642, 152777230, 285569898, 593717419, 1112188817, 2312672439, 4340728280

Offset: 0

David W. Wilson

nonn

Polyominoes with n cells and at least one line of reflection symmetry. - Joshua Zucker, Mar 08 2008

This sequence can most readily be calculated by enumerating fixed polyominoes for three different axes of symmetry: 1) a line composed of the diagonals of cells, A346800, 2) a line composed of edges of cells, and 3) a line composed of lines connecting the centers of adjacent cells, A346799. For the second case, any fixed polyomino just touching the edge line is reflected on the other side, so that sequence is A001168(n/2) for even values of n and zero otherwise. These three sequences together include each achiral polyomino exactly twice. - Robert A. Russell, Aug 04 2021

			For a(4)=3, the achiral tetrominoes are a 2 X 2 square, a 1 X 4 rectangle, and a cell plus three cells adjacent to it (forming a shortened T).

John Mason, Table of n, a(n) for n = 0..50 (terms 1..48 from Robert A. Russell.)
D. H. Redelmeier, Counting polyominoes: yet another attack, Discrete Math., 36 (1981), 191-203.
Toshihiro Shirakawa, Enumeration of Polyominoes considering the symmetry, April 2012, pp. 3-4.

Cf. A000988 (oriented), A000105 (unoriented), A030228 (chiral).
Cf. A006746, A006748, A056877, A056878, A142886 (subcategories).
Cf. A001168, A346799, A346800.

A000105 = Cases[Import["https://oeis.org/A000105/b000105.txt", "Table"], {, }][[All, 2]];
A000988 = Cases[Import["https://oeis.org/A000988/b000988.txt", "Table"], {, }][[All, 2]];
a[n_] := 2*A000105[[n + 1]] - A000988[[n]];
Array[a, 45] (* Jean-François Alcover, Sep 08 2019, after Andrew Howroyd *)

a(n) = A000105(n) - A030228(n) = 2*A000105(n) - A000988(n). - Andrew Howroyd, Dec 04 2018
a(n) = A006746(n) + A006748(n) + A056877(n) + A056878(n) + A142886(n) = A000988(n) - 2*A030228(n). - Robert A. Russell, Feb 02 2019
For odd n, a(n) = (A346799(n) + A346800(n)) / 2; for even n, a(n) = (A346799(n) + A001168(n/2) + A346800(n)) / 2. - Robert A. Russell, Aug 04 2021

a(23)-a(36) from Andrew Howroyd, Dec 04 2018
Name edited by Robert A. Russell, Feb 03 2019
Offset changed to 0, and a(0) added by John Mason, Jan 12 2023

A346799 Number of fixed polyominoes with n cells that have a horizontal axis of symmetry that passes through the centers of cells.

Original entry on oeis.org

1, 1, 2, 3, 7, 10, 24, 36, 86, 133, 314, 499, 1164, 1888, 4366, 7192, 16522, 27548, 62954, 106004, 241203, 409492, 928376, 1587151, 3586999, 6169400, 13904736, 24041597, 54053950, 93896826, 210654990, 367450477, 822754494

Offset: 1

Robert A. Russell, Aug 04 2021

nonn

This is one of three sequences needed to calculate the number of achiral polyominoes, A030227. The three sequences together contain exactly two copies of each achiral polyomino. This is the FL sequence in the Shirakawa link. The sequence can be quickly calculated using Redelmeier's method; each polyomino cell in the lowest row is counted as one, while all the other polyomino cells are counted as two. Jensen's transfer matrix method (see Knuth POLYNUM program) could be modified to enumerate this sequence for over 100 terms; one needs only to keep track of the number of polyomino cells in the original row.

John Mason has pointed out that a(n) is also the number of achiral (2n)-ominoes with twofold rotational symmetry centered at the center of an edge. Just add to each polyomino its reflection in its leftmost edge to obtain these, the subset of A056877 with edge centers. - Robert A. Russell, Dec 15 2021

			For a(5)=7, the polyominoes are:    X
X       X   XX   XX    X            X
XXX   XXX   X     X   XXX   XXXXX   X
X       X   XX   XX    X            X
                                    X

John Mason, Table of n, a(n) for n = 1..50 (terms 1..47 from Robert A. Russell).
D. E. Knuth, Program
D. H. Redelmeier, Counting polyominoes: yet another attack, Discrete Math., 36 (1981), 191-203.
Toshihiro Shirakawa, Enumeration of Polyominoes considering the symmetry, April 2012, pp. 3-4.

Cf. A030227, A056877, A346800.

a(n) = A351127(n) + 2 * A351190(n) + A346799(n / 2) + 2 * A349328(n), setting A346799(n / 2) = 0 for noninteger arguments. - John Mason, Mar 13 2023

A234006 Free polyominoes with 2n squares, having reflectional symmetry on axis that coincides with edges.

Original entry on oeis.org

1, 2, 4, 11, 35, 114, 392, 1381, 4998, 18292, 67791, 253182, 952527, 3603389, 13699516, 52300071, 200406183, 770424072, 2970400815, 11482442855, 44491876993, 172766491178, 672186631950, 2619995178793, 10228902801505, 39996341268584, 156612023001490, 614044347934591

Offset: 1

John Mason, Dec 18 2013

nonn

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.

John Mason, Table of n, a(n) for n = 1..50

Cf. A000105, A001168, A001933, A151525, A182645, A234007, A234008, A234009, A234010, A349329, A346799, A346800, A351191.

A151525 = Cases[Import["https://oeis.org/A151525/b151525.txt", "Table"], {, }][[All, 2]];
A182645 = Cases[Import["https://oeis.org/A182645/b182645.txt", "Table"], {, }][[All, 2]];
A001168 = Cases[Import["https://oeis.org/A001168/b001168.txt", "Table"], {, }][[All, 2]];
a[n_] := If[OddQ[n], A151525[[n]], A151525[[n]] + A182645[[n/2]] - A001168[[n/2]]];
Array[a, 28] (* Jean-François Alcover, Sep 10 2019, after Andrew Howroyd *)

a(2*n+1) = A151525(2*n+1), a(2*n) = A151525(2*n) + A182645(n) - A001168(n). - Andrew Howroyd, Dec 05 2018

If n odd, a(n) = A349329(n) + A346799(n), otherwise a(n) = A349329(n) + A346799(n) + A346800(n/2) + A351191(n/2). - John Mason, Mar 15 2023

a(12)-a(28) from Andrew Howroyd, Dec 05 2018

A351127 Number of polyominoes with n cells with maximal symmetry and center of rotation about the center of a square.

Original entry on oeis.org

1, 0, 0, 0, 1, 0, 0, 1, 2, 0, 0, 1, 2, 0, 0, 4, 4, 0, 0, 7, 7, 0, 0, 16, 11, 0, 0, 29, 20, 0, 0, 67, 36, 0, 0, 119, 65, 0, 0, 264, 117, 0, 0, 478, 216, 0, 0, 1043, 396, 0, 0, 1910, 736, 0, 0, 4116, 1369, 0, 0, 7592, 2558, 0, 0, 16201, 4787, 0, 0, 30114, 9006

Offset: 1

John Mason, Feb 02 2022

The sequence enumerates a subset of the polyominoes of maximal symmetry enumerated by A142886.

John Mason, Table of n, a(n) for n = 1..163

Cf. A000105, A142886, A346800.

For n multiple of 4, a(n) = A142886(n) - A346800(n/4); otherwise a(n) = A142886(n).

A377335 Number of polycubes with 8*n cells, full symmetry, and the rotation point of the symmetries at the common corner of 8 cells (that may or may not be part of the polycube).

Original entry on oeis.org

1, 0, 0, 2, 0, 1, 5, 1, 2, 12, 4, 9, 33, 14, 29, 92, 44, 105, 272, 141, 326, 793, 438, 1069, 2337, 1362, 3313, 6938, 4213, 10636, 20772, 13089, 32842, 62398, 40630, 103676, 187926, 126201, 319378, 567076, 391551, 999680, 1714404, 1214219, 3077337, 5192627

Offset: 1

Pontus von Brömssen, Oct 25 2024

nonn

The number of cells of a polycube, that has full symmetry with the rotation point of the symmetries at the common corner of 8 cells, must be a multiple of 8.

Index entries for sequences related to polyominoes.

Cf. A346800, A376971, A377334.

a(n) = A376971(8*n)-A377334(8*n).

Conjecture: a(n) < a(n-1) if and only if n mod 3 = 2.

cp's OEIS Frontend

A142886 Number of polyominoes with n cells that have the symmetry group D_8.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

Extensions

A006748 Number of diagonally symmetric polyominoes with n cells.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Formula

Extensions

A030227 Number of achiral polyominoes with n cells.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A346799 Number of fixed polyominoes with n cells that have a horizontal axis of symmetry that passes through the centers of cells.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A234006 Free polyominoes with 2n squares, having reflectional symmetry on axis that coincides with edges.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A351127 Number of polyominoes with n cells with maximal symmetry and center of rotation about the center of a square.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A377335 Number of polycubes with 8*n cells, full symmetry, and the rotation point of the symmetries at the common corner of 8 cells (that may or may not be part of the polycube).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula