A001420 - OEIS

%I M0806 N0305 #66 Sep 03 2024 11:08:40

%S 2,3,6,14,36,94,250,675,1838,5053,14016,39169,110194,311751,886160,

%T 2529260,7244862,20818498,59994514,173338962,501994070,1456891547,

%U 4236446214,12341035217,36009329450,105229462401,307942754342,902338712971,2647263986022,7775314024683,22861250676074,67284446545605

%N Number of fixed 2-dimensional triangular-celled animals with n cells (n-iamonds, polyiamonds) in the 2-dimensional hexagonal lattice.

%C The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.

%D W. F. Lunnon, Counting hexagonal and triangular polyominoes, pp. 87-100 of R. C. Read, editor, Graph Theory and Computing. Academic Press, NY, 1972.

%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

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

%H Vaclav Kotesovec, <a href="/A001420/b001420.txt">Table of n, a(n) for n = 1..75</a> (from reference by A. J. Guttmann)

%H G. Aleksandrowicz and G. Barequet, <a href="https://doi.org/10.1007/11809678_44">counting d-dimensional polycubes and nonrectangular planar polyomnoes</a>, Lect. Not. Comp. Sci 4112 (2006) 418-427 Table 3

%H G. Aleksandrowicz and G. Barequet, <a href="https://doi.org/10.1142/S0218195909002927">Counting d-dimensional polycubes and nonrectangular planar polyominoes</a>, Int. J. of Computational Geometry and Applications, 19 (2009), 215-229.

%H Gill Barequet, Solomon W. Golomb, and David A. Klarner, <a href="http://www.csun.edu/~ctoth/Handbook/chap14.pdf">Polyominoes</a>. (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.

%H Gill Barequet and Mirah Shalah, <a href="http://www.eurocg2016.usi.ch/sites/default/files/paper_19.pdf">Improved Bounds on the Growth Constant of Polyiamonds</a>, 32nd European Workshop on Computational Geometry, 2016.

%H Gill Barequet, Mira Shalah, and Yufei Zheng, <a href="https://dx.doi.org/10.1007/978-3-319-62389-4_5">An Improved Lower Bound on the Growth Constant of Polyiamonds</a>, In: Cao Y., Chen J. (eds) Computing and Combinatorics, COCOON 2017, Lecture Notes in Computer Science, vol 10392.

%H Vuong Bui, <a href="https://arxiv.org/abs/2304.10077">The number of polyiamonds is almost supermultiplicative</a>, arXiv:2304.10077 [math.CO], 2023.

%H A. J. Guttmann (ed.), <a href="https://doi.org/10.1007/978-1-4020-9927-4">Polygons, Polyominoes and Polycubes</a>, Lecture Notes in Physics, 775 (2009). (Table 16.11, p. 479 has 75 terms of this sequence.)

%H Greg Malen, Érika Roldán, and Rosemberg Toalá-Enríquez, <a href="https://doi.org/10.1007/s00026-022-00631-1">Extremal {p, q}-Animals</a>, Ann. Comb. (2023), p. 3.

%H G. Nebe and N. J. A. Sloane, <a href="http://www.math.rwth-aachen.de/~Gabriele.Nebe/LATTICES/A2.html">Home page for hexagonal (or triangular) lattice A2</a>

%H H. Redelmeier, <a href="/A006770/a006770.pdf">Emails to N. J. A. Sloane, 1991</a>

%Y Cf. A000577, A001168, A006534, A030223, A030224.

%K nonn,hard,nice

%O 1,1

%A _N. J. A. Sloane_

%E More terms from Brendan Owen (brendan_owen(AT)yahoo.com), Dec 15 2001

%E a(28) from _Joseph Myers_, Sep 24 2002

%E a(29)-a(31) from the Aleksandrowicz and Barequet paper (_N. J. A. Sloane_, Jul 09 2009)

%E Slightly edited by _Gill Barequet_, May 24 2011

%E a(32) from _Paul Church_, Oct 06 2011