OFFSET
1,3
COMMENTS
This is one of three sequences needed to calculate the number of achiral polyominoes, A030227. The three sequences together contain exactly two copies of each achiral polyomino. This is the DL sequence in the Shirakawa link. The sequence can be calculated using Redelmeier's method; one chooses an original cell such that no cells in its LL-UR diagonal on one side of it are eligible, nor are any cells in lower LL-UR diagonals. Cells in that original diagonal are counted as one; all others count as two. Jensen's transfer matrix method (see Knuth POLYNUM program) could likely be modified to enumerate this sequence for many more terms; instead of rows, one uses diagonals.
The sequence also enumerates free polyominoes of size 4*n with maximal symmetry that have a center of rotation on a vertex of the underlying square matrix, which are a subset of those enumerated by A142886. - John Mason Jan 27 2022
LINKS
John Mason, Table of n, a(n) for n = 1..50 (terms 1..47 from Robert A. Russell).
D. E. Knuth, Program
D. H. Redelmeier, Counting polyominoes: yet another attack, Discrete Math., 36 (1981), 191-203.
Toshihiro Shirakawa, Enumeration of Polyominoes considering the symmetry, April 2012, pp. 3-4.
FORMULA
EXAMPLE
For a(5)=5, the polyominoes are: XXX X X XX X
X X XX XX XXX
X XXX XX X X
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert A. Russell, Aug 04 2021
STATUS
approved