A001931 Number of fixed 3-dimensional polycubes with n cells; lattice animals in the simple cubic lattice (6 nearest neighbors), face-connected cubes. (Formerly M2996 N1213)

1, 3, 15, 86, 534, 3481, 23502, 162913, 1152870, 8294738, 60494549, 446205905, 3322769321, 24946773111, 188625900446, 1435074454755, 10977812452428, 84384157287999, 651459315795897, 5049008190434659, 39269513463794006, 306405169166373418

Offset

1,2

Comments

This gives the number of polycubes up to translation (but not rotation or reflection). - Charles R Greathouse IV, Oct 08 2013

References

W. F. Lunnon, Symmetry of cubical and general polyominoes, pp. 101-108 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

Table of n, a(n) for n=1..22.

G. Aleksandrowicz and G. Barequet, Counting d-dimensional polycubes and nonrectangular planar polyominoes, Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, pp. 418-427.

G. Aleksandrowicz and G. Barequet, Counting d-dimensional polycubes and nonrectangular planar polyominoes, Int. J. of Computational Geometry and Applications, 19 (2009), 215-229.

A. Asinowski, G. Barequet, and Y. Zheng, Polycubes with small perimeter defect, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, (2018).

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

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.

Andrew R. Conway, The design of efficient dynamic programming and transfer matrix enumeration algorithms, Journal of Physics A: Mathematical and Theoretical, 2 August 2017. For another version see arXiv, arXiv:1610.09806 [math.CO], 2016-2017.

Stanley Dodds, C# program for this sequence

Kevin L. Gong, Polyominoes Home Page

S. Luther and S. Mertens, Counting lattice animals in high dimensions, Journal of Statistical Mechanics: Theory and Experiment, 2011 (9), 546-565; arXiv:1106.1078 [cond-mat.stat-mech], 2011.

S. Mertens, Lattice animals: a fast enumeration algorithm and new perimeter polynomials, J. Stat. Phys. 58 (5-6) (1990) 1095-1108, Table 1.

H. Redelmeier, Emails to N. J. A. Sloane, 1991

Phillip Thompson, rust port of Dodds's C# program

Crossrefs

Cf. A000162, A001420, A038119 (free), A151830, A151832, A151833, A151834, A151835.

32nd row of A366767.

Sequence in context: A326275 A093615 A191148 * A306524 A355097 A180677

Adjacent sequences: A001928 A001929 A001930 * A001932 A001933 A001934

Keyword

nonn,nice,more

Author

N. J. A. Sloane

Extensions

Edited by Arun Giridhar, Feb 14 2011

a(17) from Achim Flammenkamp, Feb 15 1999

a(18) from the Aleksandrowicz and Barequet paper (N. J. A. Sloane, Jul 09 2009)

a(19) from Luther and Mertens by Gill Barequet, Jun 12 2011

a(20) from Stanley Dodds, Aug 03 2023

a(21)-a(22) (using Dodds's algorithm) from Phillip Thompson, Feb 07 2024

Status

approved