|
%I M0171 N0066 #58 Apr 15 2023 12:27:31
%S 2,1,4,7,24,62,216,710,2570,9215,34146,126853,477182,1802673,6853152,
%T 26153758,100215818,385226201,1485248464,5741275753,22246121356,
%U 86383454582,336094015456,1309998396933,5114454089528,19998173763831,78306021876974,307022186132259,1205243906123956,4736694016531135
%N Number of chessboard polyominoes with n squares.
%C Chessboard-colored 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
%D W. F. Lunnon, personal communication.
%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 John Mason, <a href="/A001933/b001933.txt">Table of n, a(n) for n = 1..50</a>
%H Joseph Myers, <a href="http://list.seqfan.eu/oldermail/seqfan/2010-November/013893.html">Chessboard polyominoes</a>
%F For odd n, a(n) = 2*A000105(n).
%F For n multiple of 2 but not of 4, a(n) = 2*A000105(n) - (A234006(n/2) + A234008(n/2)).
%F For n multiple of 4, a(n) = 2*A000105(n) - (A234006(n/2) + A234008(n/2) + A234007(n/4)). - _John Mason_, Dec 23 2021
%Y 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 90-degree rotational symmetry about a square corner, but not having reflective symmetry), A234008 (free polyominoes with 2n squares, having 180-degree rotational symmetry about a square mid-side, but no reflective symmetry).
%K hard,nonn
%O 1,1
%A _N. J. A. Sloane_
%E a(14)-a(17) from _Joseph Myers_, Oct 01 2011
%E a(18)-a(23) from _John Mason_, Dec 05 2013
%E a(24)-a(30) from _John Mason_, Dec 23 2021
|
