A006749 -id:A006749 - cp's OEIS frontend

A000105 Number of free polyominoes (or square animals) with n cells.

1, 1, 1, 2, 5, 12, 35, 108, 369, 1285, 4655, 17073, 63600, 238591, 901971, 3426576, 13079255, 50107909, 192622052, 742624232, 2870671950, 11123060678, 43191857688, 168047007728, 654999700403, 2557227044764, 9999088822075, 39153010938487, 153511100594603

Offset: 0

N. J. A. Sloane

For n>0, a(n) + A030228(n) = A000988(n) because the number of free polyominoes plus the number of polyominoes lacking bilateral symmetry equals the number of one-sided polyominoes. - Graeme McRae, Jan 05 2006
The possible symmetry groups of a (nonempty) polyomino are the 10 subgroups of the dihedral group D_8 of order 8: D_8, 1, Z_2 (five times), Z_4, (Z_2)^2 (twice). - Benoit Jubin, Dec 30 2008
Names for first few polyominoes: monomino, domino, tromino, tetromino, pentomino, hexomino, heptomino, octomino, enneomino, decomino, hendecomino, dodecomino, ...
Limit_{n->oo} a(n)^(1/n) = mu with 3.98 < mu < 4.64 (quoted by Castiglione et al., with a reference to Barequet et al., 2006, for the lower bound). The upper bound is due to Klarner and Rivest, 1973. By Madras, 1999, it is now known that this limit, also known as Klarner's constant, is equal to the limit growth rate lim_{n->oo} a(n+1)/a(n).
Polyominoes are worth exploring in the elementary school classroom. Students in grade 2 can reproduce the first 6 terms. Grade 3 students can explore area and perimeter. Grade 4 students can talk about polyomino symmetries.
The pentominoes should be singled out for special attention: 1) they offer a nice, manageable set that a teacher can commercially acquire without too much expense. 2) There are also deeply strategic games and perplexing puzzles that are great for all students. 3) A fraction of students will become engaged because of the beautiful solutions.
Conjecture: Almost all polyominoes are holey. In other words, A000104(n)/a(n) tends to 0 for increasing n. - John Mason, Dec 11 2021 (This is true, a consequence of Madras's 1999 pattern theorem. - Johann Peters, Jan 06 2024)

			a(0) = 1 as there is 1 empty polyomino with #cells = 0. - _Fred Lunnon_, Jun 24 2020

S. W. Golomb, Polyominoes, Appendix D, p. 152; Princeton Univ. Pr. NJ 1994
J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, CRC Press, 1997, p. 229.
D. A. Klarner, The Mathematical Gardner, p. 252 Wadsworth Int. CA 1981
W. F. Lunnon, Counting polyominoes, pp. 347-372 of A. O. L. Atkin and B. J. Birch, editors, Computers in Number Theory. Academic Press, NY, 1971.
W. F. Lunnon, Counting hexagonal and triangular polyominoes, pp. 87-100 of R. C. Read, editor, Graph Theory and Computing. Academic Press, NY, 1972.
George E. Martin, Polyominoes - A Guide to Puzzles and Problems in Tiling, The Mathematical Association of America, 1996
Ed Pegg, Jr., Polyform puzzles, in Tribute to a Mathemagician, Peters, 2005, pp. 119-125.
R. C. Read, Some applications of computers in graph theory, in L. W. Beineke and R. J. Wilson, editors, Selected Topics in Graph Theory, Academic Press, NY, 1978, pp. 417-444.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
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 = 0..50 (terms 0..45,47 from Toshihiro Shirakawa)
Z. Abel, E. Demaine, M. Demaine, H. Matsui and G. Rote, Common Developments of Several Different Orthogonal Boxes.
G. Barequet, M. Moffie, A. Ribo and G. Rote, Counting polyominoes on twisted cylinders, Integers 6 (2006), A22, 37 pp. (electronic).
K. S. Brown, Polyomino Enumerations
G. Castiglione, A. Frosini, E. Munarini, A. Restivo and S. Rinaldi, Combinatorial aspects of L-convex polyominoes, European J. Combin. 28 (2007), no. 6, 1724-1741.
Juris Čerņenoks and Andrejs Cibulis, Tetrads and their Counting, Baltic J. Modern Computing, Vol. 6 (2018), No. 2, 96-106.
A. Clarke, Polyominoes
A. R. Conway and A. J. Guttmann, On two-dimensional percolation, J. Phys. A: Math. Gen. 28(1995) 891-904.
I. Jensen, Enumerations of lattice animals and trees, arXiv:cond-mat/0007239 [cond-mat.stat-mech], 2000.
I. Jensen and A. J. Guttmann, Statistics of lattice animals (polyominoes) and polygons, Journal of Physics A: Mathematical and General, vol. 33, pp. L257-L263, 2000.
M. Keller, Counting polyforms.
D. A. Klarner and R. L. Rivest, A procedure for improving the upper bound for the number of n-ominoes, Canadian J. of Mathematics, 25 (1973), 585-602.
N. Madras, A pattern theorem for lattice clusters, arXiv:math/9902161 [math.PR], 1999; Annals of Combinatorics, 3 (1999), 357-384.
John Mason, Counting size 50 polyominoes -V2
S. Mertens, Lattice animals: a fast enumeration algorithm and new perimeter polynomials, J. Statistical Physics, vol. 58, no. 5/6, pp. 1095-1108, Mar. 1990.
Stephan Mertens and Markus E. Lautenbacher, Counting lattice animals: A parallel attack J. Stat. Phys., vol. 66, no. 1/2, pp. 669-678, 1992.
W. R. Muller, K. Szymanski, J. V. Knop, and N. Trinajstic, On the number of square-cell configurations, Theor. Chim. Acta 86 (1993) 269-278
Joseph Myers, Polyomino tiling
Tomás Oliveira e Silva, Animal enumerations on regular tilings in Spherical, Euclidean and Hyperbolic 2-dimensional spaces
Tomás Oliveira e Silva, Animal enumerations on the {4,4} Euclidean tiling [The enumeration to order 28]
T. R. Parkin, L. J. Lander, and D. R. Parkin, Polyomino Enumeration Results, presented at SIAM Fall Meeting, 1967, and accompanying letter from T. J. Lander (annotated scanned copy)
Anuj Pathania, Scalable Task Schedulers for Many-Core Architectures, Ph.D. Thesis, Karlsruher Instituts für Technologie (Germany, 2018).
Ed Pegg, Jr., Illustrations of polyforms
Henri Picciotto, Polyomino Lessons
Jaime Rangel-Mondragón, Polyominoes and Related Families, The Mathematica Journal, Volume 9, Issue 3.
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.
Herman Tulleken, Polyominoes 2.2: How they fit together, (2019).
Eric Weisstein's World of Mathematics, Polyomino
Wikipedia, The 35 hexominoes
Wikipedia, The 108 heptominoes
Wikipedia, The 369 octominoes
Wikipedia, Polyomino
D. Xu, T. Horiyama, T. Shirakawa and R. Uehara, Common Developments of Three Incongruent Boxes of Area 30, in Proc. 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, LNCS Vol. 9076, pp. 236-247.
L. Zucca, Pentominoes
L. Zucca, The 12 pentominoes
Index entries for "core" sequences

Sequences classifying polyominoes by symmetry group: A006746, A006747, A006748, A006749, A056877, A056878, A142886, A144553, A144554.
Cf. A001168 (not reduced by D_8 symmetry), A000104 (no holes), A054359, A054360, A001419, A000988, A030228 (chiral polyominoes).
See A006765 for another version.
Cf. also A000577, A000228, A103465, A210996 (bisection).
Excluding a(0), 8th and 9th row of A366766.

(* In this program by Jaime Rangel-Mondragón, polyominoes are represented as a list of Gaussian integers. *)
polyominoQ[p_List] := And @@ ((IntegerQ[Re[#]] && IntegerQ[Im[#]])& /@ p);
rot[p_?polyominoQ] := I*p;
ref[p_?polyominoQ] := (# - 2 Re[#])& /@ p;
cyclic[p_] := Module[{i = p, ans = {p}}, While[(i = rot[i]) != p, AppendTo[ans, i]]; ans];
dihedral[p_?polyominoQ] := Flatten[{#, ref[#]}& /@ cyclic[p], 1];
canonical[p_?polyominoQ] := Union[(# - (Min[Re[p]] + Min[Im[p]]*I))& /@ p];
allPieces[p_] := Union[canonical /@ dihedral[p]];
polyominoes[1] = {{0}};
polyominoes[n_] := polyominoes[n] = Module[{f, fig, ans = {}}, fig = ((f = #1; ({f, #1 + 1, f, #1 + I, f, #1 - 1, f, #1 - I}&) /@ f)&) /@ polyominoes[n - 1]; fig = Partition[Flatten[fig], n]; f = Select[Union[canonical /@ fig], Length[#1] == n &]; While[f != {}, ans = {ans, First[f]}; f = Complement[f, allPieces[First[f]]]]; Partition[Flatten[ans], n]];
a[n_] := a[n] = Length[ polyominoes[n]];
Table[Print["a(", n, ") = ", a[n]]; a[n], {n, 1, 12}] (* Jean-François Alcover, Mar 24 2015, after Jaime Rangel-Mondragón *)

a(n) = A000104(n) + A001419(n). - R. J. Mathar, Jun 15 2014
a(n) = A006749(n) + A006746(n) + A006748(n) + A006747(n) + A056877(n) + A056878(n) + A144553(n) + A142886(n). - Andrew Howroyd, Dec 04 2018
a(n) = A259087(n) + A259088(n). - R. J. Mathar, May 22 2019
a(n) = (4*A006746(n) + 4*A006748(n) + 4*A006747(n) + 6*A056877(n) + 6*A056878(n) + 6*A144553(n) + 7*A142886(n) + A001168(n))/8. - John Mason, Nov 14 2021

Extended to n=28 by Tomás Oliveira e Silva
Link updated by William Rex Marshall, Dec 16 2009
Edited by Gill Barequet, May 24 2011
Misspelling "polyominos" corrected by Don Knuth, May 03 2016
a(29)-a(45), a(47) from Toshihiro Shirakawa
a(46) calculated using values from A001168 (I. Jensen), A006748/A056877/A056878/A144553/A142886 (Robert A. Russell) and A006746/A006747 (John Mason), Nov 14 2021

A001168 Number of fixed polyominoes with n cells.

Original entry on oeis.org

1, 1, 2, 6, 19, 63, 216, 760, 2725, 9910, 36446, 135268, 505861, 1903890, 7204874, 27394666, 104592937, 400795844, 1540820542, 5940738676, 22964779660, 88983512783, 345532572678, 1344372335524, 5239988770268, 20457802016011, 79992676367108, 313224032098244, 1228088671826973

Offset: 0

N. J. A. Sloane

Number of rookwise connected patterns of n square cells.

N. Madras proved in 1999 the existence of lim_{n->oo} a(n+1)/a(n), which is the real limit growth rate of the number of polyominoes; and hence, this limit is equal to lim_{n->oo} a(n)^{1/n}, the well-known Klarner's constant. The currently best-known lower and upper bounds on this constant are 3.9801 (Barequet et al., 2006) and 4.6496 (Klarner and Rivest, 1973), respectively. But see also Knuth (2014).

			a(0) = 1 as there is 1 empty polyomino with #cells = 0. - _Fred Lunnon_, Jun 24 2020

Steven R. Finch, Mathematical Constants, Cambridge, 2003, pp. 378-382.
J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, CRC Press, 1997, p. 229.
A. J. Guttmann, ed., Polygons, Polyominoes and Polycubes, Springer, 2009, p. 478. (Table 16.10 has 56 terms of this sequence.)
I. Jensen. Counting polyominoes: a parallel implementation for cluster computing. LNCS 2659 (2003) 203-212, ICCS 2003
W. F. Lunnon, Counting polyominoes, pp. 347-372 of A. O. L. Atkin and B. J. Birch, editors, Computers in Number Theory. Academic Press, NY, 1971.
W. F. Lunnon, Counting hexagonal and triangular polyominoes, pp. 87-100 of R. C. Read, editor, Graph Theory and Computing. Academic Press, NY, 1972.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Gill Barequet and Gil Ben-Shachar, Table of n, a(n) for n = 0..70, a(0)..a(56) from Iwan Jensen.
Michael H. Albert, Christian Bean, Anders Claesson, Émile Nadeau, Jay Pantone, and Henning Ulfarsson, Combinatorial Exploration: An algorithmic framework for enumeration, arXiv:2202.07715 [math.CO], 2022.
G. Barequet and R. Barequet, An Improved Upper Bound on the Growth Constant of Polyominoes, Electronic Notes in Discrete Math., 2015.
Gill Barequet and Gil Ben-Shachar, Counting Polyominoes, Revisited, Proc. Symp. Algor. Eng. Exp. (ALENEX 2024), 133-143.
Gill Barequet, Gil Ben-Shachar, and Martha Carolina Osegueda, Applications of Concatenation Arguments to Polyominoes and Polycubes, EuroCG '20, 36th European Workshop on Computational Geometry, (Würzburg, Germany, 16-18 March 2020).
G. Barequet, M. Moffie, A. Ribo, and G. Rote, Counting polyominoes on twisted cylinders, Integers 6 (2006), A22, 37 pp. (electronic).
Gill Barequet and M. Shalah, Improved Bounds on the Growth Constant of Polyiamonds, 32nd European Workshop on Computational Geometry, 2016.
Gill Barequet, Solomon W. Golomb, and David A. Klarner, Polyominoes. (This is a revision, by G. Barequet, of the chapter of the same title originally written by the late D. A. Klarner for the first edition, and revised by the late S. W. Golomb for the second edition.) Preprint, 2016.
Vuong Bui, An asymptotic lower bound on the number of polyominoes, arXiv:2211.14909 [math.CO], 2022-2023. See footnote 4 for a(69) = 4619282047583828929546825973053580643926 and a(70) = 18500792645885711270652890811942343400814, attributed to Gill Barequet and Gil Ben-Shachar.
Vuong Bui, Bounding Klarner's constant from above using a simple recurrence, arXiv:2412.20143 [math.CO], 2024. See p. 1.
Stirling Chow and Frank Ruskey, Gray codes for column-convex polyominoes and a new class of distributive lattices, Discrete Mathematics, 309 (2009), 5284-5297.
A. R. Conway and A. J. Guttmann, On two-dimensional percolation, J. Phys. A: Math. Gen. 28(1995) 891-904.
Steven R. Finch, Klarner's Lattice Animal Constant [Broken link]
Steven R. Finch, Klarner's Lattice Animal Constant [From the Wayback machine]
J. Fortier, A. Goupil, J. Lortie and J. Tremblay, Exhaustive generation of gominoes, Theoretical Computer Science, 2012. - _N. J. A. Sloane_, Sep 20 2012
I. Jensen, Enumerations of lattice animals and trees, arXiv:cond-mat/0007239.
I. Jensen, Enumerations of lattice animals and trees, J. Stat. Phys. 103 (3-4) (2001) 865-881, Table II.
I. Jensen, Home page
I. Jensen, More terms [Go to series, animals, number of animals]
I. Jensen, More terms [pdf file of lost web link]
I. Jensen and A. J. Guttmann, Statistics of lattice animals (polyominoes) and polygons, J. Phys. A 33, L257-L263 (2000).
D. A. Klarner and R. L. Rivest, A procedure for improving the upper bound for the number of n-ominoes, Canadian J. of Mathematics, 25 (1973), 585-602.
D. E. Knuth, Program
D. E. Knuth, First 47 terms
D. E. Knuth, Problems That Philippe Would Have Loved, Paris 2014.
C. Lesieur and L. Vuillon, From Tilings to Fibers - Bio-mathematical Aspects of Fold Plasticity, Chapter 13 (pages 395-422) of "Oligomerization of Chemical and Biological Compounds", book edited by Claire Lesieur, ISBN 978-953-51-1617-2, 2014.
N. Madras, A pattern theorem for lattice clusters, arXiv:math/9902161 [math.PR], 1999; Annals of Combinatorics, 3 (1999), 357-384.
Toufik Mansour and Armend Sh. Shabani, Enumerations on bargraphs, Discrete Math. Lett. (2019) Vol. 2, 65-94.
Tomás Oliveira e Silva, Enumeration of polyominoes
Jaime Rangel-Mondragón, Polyominoes and Related Families, The Mathematica Journal, Volume 9, Issue 3.
D. H. Redelmeier, Counting polyominoes: yet another attack, Discrete Math., 36 (1981), 191-203.
M. F. Sykes and M. Glen, Percolation processes in two dimensions. I. Low-density series expansions, J. Phys. A 9 (1) (1987) 87.
Hugo Tremblay and Julien Vernay, On the generation of discrete figures with connectivity constraints, RAIRO-Theor. Inf. Appl. (2024) Vol. 58, Art. No. 16. See p. 13.
Eric Weisstein's World of Mathematics, Polyomino
Index entries for sequences related to polyominoes

Cf. A000105, A000988, A006746, A056877, A006748, A056878, A006747, A006749, A142886, A144553, row sums of A308359, A210986 (bisection), A210987 (bisection).
A006762 is another version.
Excluding a(0), 8th and 9th row of A366767.

Mathematica
```
See Jaime Rangel-Mondragón's article.
```

For asymptotics, see Knuth (2014).

a(n) = 8*A006749(n) + 4*A006746(n) + 4*A006748(n) + 4*A006747(n) + 2*A056877(n) + 2*A056878(n) + 2*A144553(n) + A142886(n); the number of fixed polyominoes is calculatable according to multiples of the numbers of the various symmetries of the polyomino. - John Mason, Sep 06 2017

Extended to n=28 by Tomás Oliveira e Silva
Extended to n=46 by Iwan Jensen
Verified (and one more term found) by Don Knuth, Jan 09 2001
Richard C. Schroeppel communicated Jensen's calculation of the first 56 terms, Feb 21 2005
Gill Barequet commented on Madras's proof from 1999 of the limit growth rate of this sequence, and provided references to the currently best-known bounds on it, May 24 2011
Incorrect Mathematica program removed by Jean-François Alcover, Mar 24 2015
a(0) = 1 added by N. J. A. Sloane, Jun 24 2020

A000104 Number of n-celled free polyominoes without holes.

Original entry on oeis.org

1, 1, 1, 2, 5, 12, 35, 107, 363, 1248, 4460, 16094, 58937, 217117, 805475, 3001127, 11230003, 42161529, 158781106, 599563893, 2269506062, 8609442688, 32725637373, 124621833354, 475368834568, 1816103345752, 6948228104703, 26618671505989, 102102788362303

Offset: 0

N. J. A. Sloane

J. S. Madachy, Pentominoes - Some Solved and Unsolved Problems, J. Rec. Math., 2 (1969), 181-188.
George E. Martin, Polyominoes - A Guide to Puzzles and Problems in Tiling, The Mathematical Association of America, 1996
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
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 = 0..40
Elena V. Konstantinova and Maxim V. Vidyuk, Discriminating tests of information and topological indices. Animals and trees, J. Chem. Inf. Comput. Sci. 43 (2003), 1860-1871.
John Mason, Description of counting programs
John Mason, Programs for calculation of numbers of unholey polyominoes
Lucia Moura and Ivan Stojmenovic, Backtracking and Isomorph-Free Generation of Polyhexes, Table 2.2 on p. 55 of Handbook of Applied Algorithms (2008).
W. R. Muller, K. Szymanski, J. V. Knop, and N. Trinajstic, On the number of square-cell configurations, Theor. Chim. Acta 86 (1993) 269-278
Tomás Oliveira e Silva, Enumeration of polyominoes
T. R. Parkin, L. J. Lander, and D. R. Parkin, Polyomino Enumeration Results, presented at SIAM Fall Meeting, 1967, and accompanying letter from T. J. Lander (annotated scanned copy)
R. C. Read, Contributions to the cell growth problem, Canad. J. Math., 14 (1962), 1-20.

Cf. A000105, row sums of A308300, A006746, A056877, A006748, A056878, A006747, A006749, A054361, A070765 (polyiamonds), A018190 (polyhexes), A266549 (by perimeter).

Cf. A056879, A056880, A056881, A056882, A006724, A357647, A357648.

a(n) = A000105(n) - A001419(n). - John Mason, Sep 06 2022

a(n) = (4*A056879(n) + 4*A056881(n) + 4*A056883(n) + 6*A056880(n) + 6*A056882(n) + 6*A357647(n) + 7*A357648(n) + A006724(n)) / 8. - John Mason, Oct 10 2022

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

a(27)-a(28) from Tomás Oliveira e Silva's page added by Andrey Zabolotskiy, Oct 02 2022

A144553 Number of chiral pairs of polyominoes with n cells that have precisely the symmetry group of order 4 generated by 90-degree rotations.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 3, 2, 0, 0, 12, 7, 0, 0, 44, 25, 0, 0, 165, 90, 0, 0, 603, 319, 0, 0, 2235, 1136, 0, 0, 8283, 4088, 0, 0, 30936, 14868, 0, 0, 116111, 54526, 0, 0, 438465, 201527, 0, 0, 1663720, 750169, 0, 0, 6342211, 2809931, 0, 0, 24273767

Offset: 1

N. J. A. Sloane, Jan 01 2009

nonn

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

			For a(8)=1, the polyomino is a central 2 X 2 square with one cell attached to each edge of that square. - _Robert A. Russell_, Nov 01 2021

Robert A. Russell, Table of n, a(n) for n = 1..95
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...
Robert A. Russell, C++ Program
Toshihiro Shirakawa, Enumeration of Polyominoes considering the symmetry, April 2012, pp. 3-4.

Sequences classifying polyominoes by symmetry group: A000105, A006746, A006747, A006748, A006749, A056877, A056878, A142886, A144553, A144554, A351142, A234007.
Cf. A324408, A324409 (inner rings).
Cf. A348848 (C90), A348849 (F90).

A006747 = Cases[Import["https://oeis.org/A006747/b006747.txt",
     "Table"], {, }][[All, 2]];
A006749 = Cases[Import["https://oeis.org/A006749/b006749.txt",
     "Table"], {, }][[All, 2]];
A030228 = Cases[Import["https://oeis.org/A030228/b030228.txt",
     "Table"], {, }][[All, 2]];
a[n_] := A030228[[n+1]] - A006747[[n]] - A006749[[n]];
Array[a, 43] (* Jean-François Alcover, Sep 09 2019, updated Aug 17 2022 *)

a(n) = A030228(n) - A006747(n) - A006749(n). - Jean-François Alcover, Sep 09 2019, after Andrew Howroyd in A030228.
a(n) = (A348848(n/4)+A348849(n)-A142886(n)) / 2, where the first two are F90 and C90 of the Shirakawa link. - Robert A. Russell, Nov 01 2021
a(n) = A351142(n) + A234007(n/4) if n is a multiple of 4, otherwise a(n) = A351142(n). - John Mason, Feb 17 2022

a(28) added by Andrew Howroyd, Dec 04 2018
a(29)-a(91) added by Robert A. Russell, May 23 2020
Warning: It seems that the C++ program and the Mathematica program produce different results. This means that the b-file, and possibly even the terms in the DATA lines, are suspect. - N. J. A. Sloane, Aug 17 2022
After John Mason's Apr 15 2023 correction to the b-file of A006749, the discrepancy disappeared. - Andrey Zabolotskiy, Jan 18 2024

A006747 Number of rotationally symmetric polyominoes with n cells (that is, polyominoes with exactly the symmetry group C_2 generated by a 180-degree rotation).

Original entry on oeis.org

0, 0, 0, 1, 1, 5, 4, 18, 19, 73, 73, 278, 283, 1076, 1090, 4125, 4183, 15939, 16105, 61628, 62170, 239388, 240907, 932230, 936447, 3641945, 3651618, 14262540, 14277519, 55987858, 55961118, 220223982, 219813564, 867835023, 865091976, 3425442681

Offset: 1

N. J. A. Sloane

nonn

This sequence gives the number of free polyominoes with symmetry group "R" in Redelmeier's notation. See his Tables 1 and 3, also the column "Rot" in Oliveira e Silva's table.

The rotation center of a polyomino with this symmetry may lie at the center of a square, the middle of an edge, or a vertex of a square. These subsets are enumerated by A351615, A234008 and A351616 respectively. - John Mason, Feb 17 2022, reformulated by Günter Rote, Oct 19 2023

			a(2) = 0 because the "domino" polyomino has symmetry group of order 4.
For n=3, the three-celled polyomino [ | | ] has group of order 4, and the polyomino
. [ ]
. [ | ]
has only reflective symmetry, so a(3) = 0.
a(4) = 1 because of (in Golomb's notation) the "skew tetromino".

S. W. Golomb, Polyominoes, Princeton Univ. Press, NJ, 1994.
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
Tomás Oliveira e Silva, Enumeration of polyominoes
Tomás Oliveira e Silva, Numbers of polyominoes classified according to Redelmeier's symmetry classes (an extract from the previous link)
D. H. Redelmeier, Counting polyominoes: yet another attack, Discrete Math., 36 (1981), 191-203.
D. H. Redelmeier, Table 3 of Counting polyominoes...

Cf. A000105, A001168, A006746, A056877, A006748, A056878, A006747, A006749.
Sequences classifying polyominoes by symmetry group: A000105, A006746, A006747, A006748, A006749, A056877, A056878, A142886, A144553, A144554, A351615, A234008, A351616.
Polyomino rings of length 2n with twofold rotational symmetry: A348402, A348403, A348404.

a(n) = A351615(n) + A234008(n/2) + A351616(n/2) for even n, otherwise a(n) = A351615(n). - John Mason, Feb 17 2022

Extended to n=28 by Tomás Oliveira e Silva
a(1)-a(3) prepended by Andrew Howroyd, Dec 04 2018
Edited by N. J. A. Sloane, Nov 28 2020
a(29)-a(36) from John Mason, Oct 16 2021

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

N. J. A. Sloane, Sep 03 2000

nonn

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

			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

Robert A. Russell, Table of n, a(n) for n = 1..81
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...
Wikipedia, Symmetries of polyominoes

Cf. A000105, A001168, A006746, A006748, A056878, A006747, A006749, A346799, A351190, A351191.

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

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

More terms from Robert A. Russell, Jan 16 2019

A006746 Number of axially symmetric polyominoes with n cells.

Original entry on oeis.org

0, 0, 0, 1, 2, 6, 9, 23, 38, 90, 147, 341, 564, 1294, 2148, 4896, 8195, 18612, 31349, 70983, 120357, 271921, 463712, 1045559, 1792582, 4034832, 6950579, 15619507, 27023509, 60638559, 105320716, 236006955, 411364068, 920626423, 1609836928

Offset: 1

N. J. A. Sloane

nonn

Number of polyominoes with n cells and exactly one line of reflection symmetry, where that one line is parallel to the grid. - Joshua Zucker, Mar 08 2008

The line of reflective symmetry may pass through the center of a square or a vertex of a square. These subsets are enumerated by A349328 and A349329 respectively. - John Mason, Feb 17 2022

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
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...

Cf. A000105, A001168, A030227, A361625.

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

a(n) = A349328(n) + A349329(n/2) for even n, otherwise a(n) = A349328(n). - John Mason, Feb 17 2022

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

A056878 Number of polyominoes with n cells, symmetric about diagonal 2.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 2, 3, 3, 5, 6, 14, 9, 20, 20, 56, 32, 80, 64, 224, 114, 315, 217, 863, 397, 1234, 751, 3331, 1400, 4816, 2632, 12815, 4973, 18792, 9349, 49400, 17810, 73338, 33557, 190643, 64309, 286368, 121511, 737532, 233891, 1119215, 443271, 2859154

Offset: 1

N. J. A. Sloane, Sep 03 2000

nonn

The sequence refers to those polyominoes having reflective symmetry on both diagonals, consequent 180-degree rotational symmetry, but without 90-degree rotational symmetry. Such polyominoes with rotational symmetry symmetry centered about square centers and vertices are enumerated by A351159 and A351160 respectively. - John Mason, Feb 17 2022

			For a(7)=1, the heptomino with exactly fourfold symmetry and axes of symmetry parallel to the diagonals of the cells is composed of two 2 X 2 squares with one cell in common. For a(8)=1, the octomino is composed of a 2 X 2 square and the four cells adjacent to two nonadjacent cells of that square.

Robert A. Russell, Table of n, a(n) for n = 1..87
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...

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

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

a(n) = A351159(n) + A351160(n/2) for even n, otherwise a(n) = A351159(n). - John Mason, Feb 17 2022

More terms from Robert A. Russell, Jan 18 2019

cp's OEIS Frontend

A259093 Erroneous version of A006749.

Views

Author

Keywords

Comments

Links

A000105 Number of free polyominoes (or square animals) with n cells.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A001168 Number of fixed polyominoes with n cells.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A000104 Number of n-celled free polyominoes without holes.

Views

Author

Keywords

References

Links

Crossrefs

Formula

Extensions

A144553 Number of chiral pairs of polyominoes with n cells that have precisely the symmetry group of order 4 generated by 90-degree rotations.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A006747 Number of rotationally symmetric polyominoes with n cells (that is, polyominoes with exactly the symmetry group C_2 generated by a 180-degree rotation).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Formula

Extensions

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

Extensions

A006746 Number of axially symmetric polyominoes with n cells.

Views

Author

Keywords

Comments