A005519 Let T(n,d) = number of distinct d-dimensional polyominoes (or polycubes) with n cells (A049429, A049430); sequence gives Sum_{d} T(n,d).

1, 1, 2, 7, 26, 153, 1134, 11050, 128987, 1765252, 27418060

Offset: 1

Author

N. J. A. Sloane

Keywords

• nonn
• nice
• hard
• more

Comments

These are free polyominoes, meaning that they are counted up to rotation, reflection, and translation. - Peter Kagey, Apr 30 2020

References

• Dan Hoey, Bill Gosper and Richard C. Schroeppel, Discussions in Math-Fun Mailing list, circa Jul 13 1999.
• W. F. Lunnon, personal communication.
• N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

• R. C. Schroeppel, A few mathematical experiments

Crossrefs

Row sums of A049429 or A049430.

Extensions

a(9) from Richard C. Schroeppel

a(10) and a(11) from Peter Kagey, Apr 30 2020, based on the rows John Niss Hansen added to A049430