|
COMMENT
|
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" (g_m(AT)mcraefamily.com), 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", ...
|
|
REFERENCES
|
Barequet, Gill; Moffie, Micha; Ribo, Ares; and Rote, Guenter, Counting polyominoes on twisted cylinders. Integers 6 (2006), A22, 37 pp. (electronic).
G. Castiglione, A. Frosini, E. Munarini, A. Restivo and S. Rinaldi, Combinatorial aspects of L-convex polyominoes, to appear in European Journal of Combinatorics, 2007.
A. R. Conway and A. J. Guttmann, On two-dimensional percolation, J. Phys. A: Math. Gen. 28(1995) 891-904.
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.
I. Jensen, Enumerations of lattice animals and trees, arXiv cond-mat/0007239.
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.
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.
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.
S. Mertens, Counting lattice animals: a parallel attack, Journal of Statistical Physics, vol. 66, no. 1/2, pp. 669-678, 1992.
Ed Pegg, Jr., Polyform puzzles, in Tribute to a Mathemagician, Peters, 2005, pp. 119-125.
Jaime Rangel-Mondragon, Polyominoes and Related Families, The Mathematica Journal, 9:3 (2005), 609-640.
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.
D. H. Redelmeier, Counting polyominoes: yet another attack, Discrete Math., 36 (1981), 191-203.
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).
|