

A001933


Number of chessboard polyominoes with n squares.
(Formerly M0171 N0066)


13



2, 1, 4, 7, 24, 62, 216, 710, 2570, 9215, 34146, 126853, 477182, 1802673, 6853152, 26153758, 100215818, 385226201, 1485248464, 5741275753, 22246121356, 86383454582, 336094015456, 1309998396933, 5114454089528, 19998173763831, 78306021876974, 307022186132259, 1205243906123956, 4736694016531135
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

Chessboardcolored polyominoes, considering to be distinct two shapes that cannot be mapped onto each other by any form of symmetry. For example, there are two distinct monominoes, one black, one white. There is only one domino, with one black square, and one white.  John Mason, Nov 25 2013


REFERENCES

W. F. Lunnon, personal communication.
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



FORMULA



CROSSREFS

Cf. A001071, A000105, A121198, A234006 (free polyominoes of size 2n that have at least reflectional symmetry on a horizontal or vertical axis that coincides with the edges of some of the squares), A234007 (free polyominoes with 4n squares, having 90degree rotational symmetry about a square corner, but not having reflective symmetry), A234008 (free polyominoes with 2n squares, having 180degree rotational symmetry about a square midside, but no reflective symmetry).


KEYWORD

hard,nonn


AUTHOR



EXTENSIONS



STATUS

approved



