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.

A056877 Number of polyominoes with n cells, symmetric about two orthogonal axes.

Original entry on oeis.org

0, 1, 1, 1, 1, 2, 3, 4, 4, 8, 10, 15, 17, 30, 35, 60, 64, 117, 128, 236, 241, 459, 476, 937, 912, 1813, 1789, 3706, 3456, 7187, 6779, 14712, 13161, 28571, 25839, 58457, 50348, 113798, 98957, 232718, 193375, 453969, 380522, 927601, 745248, 1813219, 1468202, 3702063
Offset: 1

Views

Author

N. J. A. Sloane, Sep 03 2000

Keywords

Comments

This sequence counts polyominoes with exactly the symmetry group D_4 generated by horizontal and vertical reflections.
The subset of (2n)-ominoes with edge centers in this set are enumerated by A346799(n). - Robert A. Russell, Dec 15 2021
Polyominoes centered about square centers and vertices are enumerated by A351190 and A351191 respectively. - John Mason, Feb 15 2022

Examples

			For a(8)=4, the four octominoes with exactly fourfold symmetry and axes of symmetry parallel to the edges of the cells are a row of eight cells, two adjacent rows of four cells, a row of four cells with another four cells adjacent to its center cells, and a row of four cells with another four cells adjacent to its end cells (but not in the original row):
  XXXXXXXX
.
   XXXX
   XXXX
.
   XX
  XXXX
   XX
.
  X  X
  XXXX
  X  X
		

Crossrefs

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

Formula

a(n) = A351190(n) + A346799(n/2) + A351191(n/4) if we accept the convention that Axxxxxx(y) = 0 for any noninteger y. - John Mason, Feb 15 2022

Extensions

More terms from Robert A. Russell, Jan 16 2019

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

Views

Author

Robert A. Russell, Aug 04 2021

Keywords

Comments

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

Examples

			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
		

Crossrefs

Formula

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

A361625 Number of free polyominoes with checkerboard-pattern-colored vertices with n cells.

Original entry on oeis.org

1, 1, 3, 7, 20, 60, 204, 702, 2526, 9180, 33989, 126713, 476597, 1802109, 6850969, 26151529, 100207548, 385217382, 1485216987, 5741240989, 22246000726, 86383317470, 336093551268, 1309997856337, 5114452295933, 19998171631076, 78306014924606, 307022177714062
Offset: 1

Views

Author

Andrey Zabolotskiy, Mar 19 2023; thanks to John Mason for his help

Keywords

Comments

Also, number of polysticks of size n (see A019988), with the requirement that any two sticks are connected by a sequence of adjacent, alternately horizontal and vertical sticks. - Pontus von Brömssen, Sep 01 2023

Examples

			There are 2 ways to color the 4 corners of a monomino with black and white colors alternatingly, but they are related by a rotation or a reflection, so a(1) = 1. a(2) is also 1 because the two ways to color the 6 vertices of a domino with black and white colors in the checkerboard pattern are related to each other by a reflection or a rotation. The same is true for the stick tromino, but the two ways to color the 8 vertices of the L-tromino are inequivalent, so a(3) = 3.
For n = 3, the a(3) = 3 allowed polysticks are:
  _     _
  _|  _|   _|_
		

Crossrefs

A122675 is the 3-dimensional analog based on polycubes.
5th row of A366766.

Formula

a(n) = 2 * A000105(n) - (A351190(n) + A351142(n) + A351127(n) + A349328(n) + A346799(n/2) + A234008(n/2)), where the last two terms are only included if 2|n. I.e., every free polyomino is counted twice here unless it is symmetric with respect to a Pi/2 rotation centered at a cell, or a Pi rotation centered at an edge, or a reflection with respect to an axis parallel to the grid and passing through cells.
Showing 1-3 of 3 results.