[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Search: a006535 -id:a006535
     Sort: relevance | references | number | modified | created      Format: long | short | data
Number of hexagonal polyominoes (or hexagonal polyforms, or planar polyhexes) with n cells.
(Formerly M2682 N1072)
+10
73
1, 1, 3, 7, 22, 82, 333, 1448, 6572, 30490, 143552, 683101, 3274826, 15796897, 76581875, 372868101, 1822236628, 8934910362, 43939164263, 216651036012, 1070793308942, 5303855973849, 26323064063884, 130878392115834, 651812979669234, 3251215493161062, 16240020734253127, 81227147768301723, 406770970805865187, 2039375198751047333
OFFSET
1,3
COMMENTS
From Markus Voege, Nov 24 2009: (Start)
On the difference between this sequence and A038147:
The first term that differs is for n=6; for all subsequent terms, the number of polyhexes is larger than the number of planar polyhexes.
If I recall correctly, polyhexes are clusters of regular hexagons that are joined at the edges and are LOCALLY embeddable in the hexagonal lattice.
"Planar polyhexes" are polyhexes that are GLOBALLY embeddable in the honeycomb lattice.
Example: (Planar) polyhex with 6 cells (x) and a hole (O):
.. x x
. x O x
.. x x
Polyhex with 6 cells that is cut open (I):
.. xIx
. x O x
.. x x
This polyhex is not globally embeddable in the honeycomb lattice, since adjacent cells of the lattice must be joined. But it can be embedded locally everywhere. It is a start of a spiral. For n>6 the spiral can be continued so that the cells overlap.
Illegal configuration with cut (I):
.. xIx
. x x x
.. x x
This configuration is NOT a polyhex since the vertex at
.. xIx
... x
is not embeddable in the honeycomb lattice.
One has to keep in mind that these definitions are inspired by chemistry. Hence, potential molecules are often the motivation for these definitions. Think of benzene rings that are fused at a C-C bond.
The (planar) polyhexes are "free" configurations, in contrast to "fixed" configurations as in A001207 = Number of fixed hexagonal polyominoes with n cells.
A000228 (planar polyhexes) and A001207 (fixed hexagonal polyominoes) differ only by the attribute "free" vs. "fixed," that is, whether the different orientations and reflections of an embedding in the lattice are counted.
The configuration
. x x .... x
.. x .... x x
is counted once as free and twice as fixed configurations.
Since most configurations have no symmetry, (A001207 / A000228) -> 12 for n -> infinity. (End)
REFERENCES
A. T. Balaban and F. Harary, Chemical graphs V: enumeration and proposed nomenclature of benzenoid cata-condensed polycyclic aromatic hydrocarbons, Tetrahedron 24 (1968), 2505-2516.
A. T. Balaban and Paul von R. Schleyer, "Graph theoretical enumeration of polymantanes", Tetrahedron, (1978), vol. 34, 3599-3609
M. Gardner, Polyhexes and Polyaboloes. Ch. 11 in Mathematical Magic Show. New York: Vintage, pp. 146-159, 1978.
M. Gardner, Tiling with Polyominoes, Polyiamonds and Polyhexes. Chap. 14 in Time Travel and Other Mathematical Bewilderments. New York: W. H. Freeman, pp. 175-187, 1988.
J. V. Knop et al., On the total number of polyhexes, Match, No. 16 (1984), 119-134.
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).
LINKS
John Mason and Robert A. Russell, Table of n, a(n) for n = 1..36
Frédéric Chyzak, Ivan Gutman, and Peter Paule, Predicting the number of hexagonal systems with 24 and 25 hexagons, Communications in Mathematical and Computer Chemistry (1999) No. 40, 139-151. See p. 141.
A. Clarke, Polyhexes
F. Harary and R. C. Read, The enumeration of tree-like polyhexes, Proc. Edinburgh Math. Soc. (2) 17 (1970), 1-13.
D. Gouyou-Beauchamps and P. Leroux, Enumeration of symmetry classes of convex polyominoes on the honeycomb lattice, arXiv:math/0403168 [math.CO], 2004.
D. A. Klarner, Cell growth problems, Canad. J. Math. 19 (1967) 851-863.
J. V. Knop, K. Szymanski, Ž. Jeričević, and N. Trinajstić, On the total number of polyhexes, Match, No. 16 (1984), 119-134.
Greg Malen, Érika Roldán, and Rosemberg Toalá-Enríquez, Extremal {p, q}-Animals, Ann. Comb. (2023), p. 3.
John Mason, Counting polyhexes of size 36, updated Oct 27 2023.
Jaime Rangel-Mondragon, Polyominoes and Related Families, The Mathematica Journal, 9:3 (2005), 609-640.
N. Trinajstich, Z. Jerievi, J. V. Knop, W. R. Muller and K. Szymanski, Computer Generation of Isomeric Structures, Pure & Appl. Chem., Vol. 55, No. 2, pp. 379-390, 1983.
Eric Weisstein's World of Mathematics, Polyhex.
KEYWORD
nonn,nice,hard
EXTENSIONS
a(13) from Achim Flammenkamp, Feb 15 1999
a(14) from Brendan Owen, Dec 31 2001
a(15) from Joseph Myers, May 05 2002
a(16)-a(20) from Joseph Myers, Sep 21 2002
a(21) from Herman Jamke (hermanjamke(AT)fastmail.fm), May 05 2007
a(22)-a(30) from John Mason, Jul 18 2023
STATUS
approved
Number of fixed hexagonal polyominoes with n cells.
(Formerly M2897 N1162)
+10
20
1, 3, 11, 44, 186, 814, 3652, 16689, 77359, 362671, 1716033, 8182213, 39267086, 189492795, 918837374, 4474080844, 21866153748, 107217298977, 527266673134, 2599804551168, 12849503756579, 63646233127758, 315876691291677, 1570540515980274, 7821755377244303, 39014584984477092, 194880246951838595, 974725768600891269, 4881251640514912341, 24472502362094874818, 122826412768568196148, 617080993446201431307, 3103152024451536273288, 15618892303340118758816, 78679501136505611375745
OFFSET
1,2
REFERENCES
A. J. Guttmann, ed., Polygons, Polyominoes and Polycubes, Springer, 2009, p. 477. (Table 16.9 has 46 terms of this sequence.)
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).
LINKS
Vaclav Kotesovec, Table of n, a(n) for n = 1..46 (from reference by A. J. Guttmann)
Moa Apagodu, Counting hexagonal lattice animals, arXiv:math/0202295 [math.CO], 2002-2009.
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.
M. Bousquet-Mélou and A. Rechnitzer, Lattice animals and heaps of dimers, Discrete Mathematics, Volume 258, Issues 1-3, 6 December 2002, Pages 235-274.
Greg Malen, Érika Roldán, and Rosemberg Toalá-Enríquez, Extremal {p, q}-Animals, Ann. Comb. (2023), p. 3.
Stephan Mertens, Markus E. Lautenbacher, Counting lattice animals: a parallel attack, J. Statist. Phys. 66 (1992), no. 1-2, 669-678.
M. F. Sykes, M. Glen. Percolation processes in two dimensions. I. Low-density series expansions, J. Phys A 9 (1) (1976) 87.
Markus Voege and Anthony J. Guttmann, On the number of hexagonal polyominoes, Theoretical Computer Sciences, 307(2) (2003), 433-453. (Table 2 has 35 terms of this sequence.)
CROSSREFS
Cf. A000228 (free), A006535 (one-sided).
Cf. A121220 (simply connected), A059716 (column convex).
KEYWORD
nonn,nice
EXTENSIONS
3 more terms and reference from Achim Flammenkamp, Feb 15 1999
More terms from Markus Voege (markus.voege(AT)inria.fr), Mar 25 2004
STATUS
approved
Number of achiral hexagonal polyominoes with n cells.
+10
8
1, 1, 3, 4, 11, 17, 46, 75, 202, 341, 914, 1581, 4222, 7436, 19794, 35357, 93859, 169558, 449039, 818793, 2163827, 3976636, 10489341, 19406704, 51103471, 95099113, 250040802, 467679257, 1227941119, 2307128946
OFFSET
1,3
COMMENTS
These are polyominoes of the Euclidean regular tiling of hexagons with Schläfli symbol {6,3}. This sequence can most readily be calculated by enumerating fixed polyominoes for three situations: 1) fixed polyominoes with a horizontal axis of symmetry along an edge of a cell with no cell centered on that axis, A001207(n/2), 2) fixed polyominoes with a horizontal axis of symmetry that is a diagonal of at least one cell, A347258, and 3) fixed polyominoes with a horizontal axis of symmetry that joins the midpoints of opposite edges of at least one cell, A347257. These three sequences include each achiral polyomino exactly twice. - Robert A. Russell, Aug 24 2021
FORMULA
From Robert A. Russell, Aug 24 2021: (Start)
For odd n, a(n) = (A347257(n) + A347258(n)) / 2; for even n, a(n) = (A001207(n/2) + A347257(n) + A347258(n)) / 2.
a(n) = 2*A000228(n) - A006535(n) = A006535(n) - 2*A030226(n) = A000228(n) - A030226(n). (End)
MATHEMATICA
A[s_Integer] := With[{s6 = StringPadLeft[ToString[s], 6, "0"]}, Cases[ Import["https://oeis.org/A" <> s6 <> "/b" <> s6 <> ".txt", "Table"], {_, _}][[All, 2]]];
A000228 = A@000228;
A006535 = A@006535;
a[n_] := 2 A000228[[n]] - A006535[[n]];
a /@ Range[20] (* Jean-François Alcover, Feb 22 2020 *)
CROSSREFS
Cf. A006535 (oriented), A000228 (unoriented), A030226 (chiral).
Calculation components: A001207, A347257, A347258.
Other tilings: A030223 {3,6}, A030227 {4,4}.
KEYWORD
nonn,more
EXTENSIONS
More terms from Joseph Myers, Sep 21 2002
Name edited by Robert A. Russell, Aug 24 2021
STATUS
approved
Number of free poly-IH10-tiles (holes allowed) with n cells.
+10
5
1, 1, 5, 16, 62, 276, 1222, 5563, 25805, 120909, 572011, 2727485, 13089106, 63164265
OFFSET
1,3
COMMENTS
Equivalently, polyhexes where two polyhexes are considered equivalent if and only if they are related by a translation or a rotation of order 3.
REFERENCES
Branko Grünbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987, Sections 6.2 and 9.4.
KEYWORD
hard,nonn
AUTHOR
Joseph Myers, Oct 16 2011
STATUS
approved
Number of free poly-IH8-tiles (holes allowed) with n cells.
+10
5
1, 3, 7, 28, 99, 433, 1852, 8463, 38798, 181889, 858570, 4093739, 19636172, 94759074
OFFSET
1,2
COMMENTS
Equivalently, one-sided polybricks, or polyhexes where two polyhexes are considered equivalent if and only if they are related by a translation or a rotation of order 2.
REFERENCES
Branko Grünbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987, Sections 6.2 and 9.4.
LINKS
KEYWORD
hard,nonn,more
AUTHOR
Joseph Myers, Oct 16 2011
STATUS
approved
Number of free poly-IH18-tiles (holes allowed) with n cells.
+10
5
1, 1, 4, 10, 37, 147, 637, 2823, 13020, 60649, 286549, 1364667, 6547108, 31586568
OFFSET
1,3
COMMENTS
Equivalently, polyhexes where two polyhexes are considered equivalent if and only if they are related by a translation, a rotation of order 3 or a reflection or glide reflection in a line perpendicular to the sides of the hexagons.
REFERENCES
Branko Grünbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987, Sections 6.2 and 9.4.
KEYWORD
hard,nonn
AUTHOR
Joseph Myers, Oct 16 2011
STATUS
approved
Number of free poly-IH19-tiles (holes allowed) with n cells.
+10
5
1, 1, 4, 10, 36, 146, 631, 2815, 12987, 60601, 286376, 1364399, 6546220, 31585133
OFFSET
1,3
COMMENTS
Equivalently, polyhexes where two polyhexes are considered equivalent if and only if they are related by a translation, a rotation of order 3 or a reflection or glide reflection in a line parallel to the sides of the hexagons.
REFERENCES
Branko Grünbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987, Sections 6.2 and 9.4.
KEYWORD
hard,nonn
AUTHOR
Joseph Myers, Oct 16 2011
STATUS
approved
Number of free poly-IH12-tiles (holes allowed) with n cells.
+10
5
1, 2, 7, 24, 99, 416, 1852, 8386, 38797, 181530, 858560, 4092031, 19636098, 94750833
OFFSET
1,2
COMMENTS
Equivalently, polyhexes where two polyhexes are considered equivalent if and only if they are related by a translation or a reflection or glide reflection in a line in one fixed direction perpendicular to the sides of the hexagons.
REFERENCES
Branko Grünbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987, Sections 6.2 and 9.4.
KEYWORD
hard,nonn
AUTHOR
Joseph Myers, Oct 16 2011
STATUS
approved
Number of free poly-IH14-tiles (holes allowed) with n cells.
+10
5
1, 2, 7, 24, 98, 415, 1846, 8378, 38764, 181482, 858387, 4091763, 19635210, 94749398
OFFSET
1,2
COMMENTS
Equivalently, polyhexes where two polyhexes are considered equivalent if and only if they are related by a translation or a reflection or glide reflection in a line in one fixed direction parallel to the sides of the hexagons.
REFERENCES
Branko Grünbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987, Sections 6.2 and 9.4.
KEYWORD
hard,nonn
AUTHOR
Joseph Myers, Oct 16 2011
STATUS
approved
Number of free asymmetrical polyhexes with n cells.
+10
2
0, 0, 0, 2, 10, 57, 279, 1338, 6329, 29969, 142461, 680637, 3269716, 15785281, 76557773, 372812193, 1822122394, 8934639920, 43938614933, 216649723022, 1070790651782, 5303849549438, 26323051151997, 130878360554692, 651812916543553, 3251215337590494, 16240020424411300, 81227146998545009, 406770969279959357, 2039375194931563287
OFFSET
1,4
LINKS
CROSSREFS
KEYWORD
nonn
AUTHOR
John Mason, Jul 18 2023
STATUS
approved

Search completed in 0.010 seconds