Key points are not available for this paper at this time.
Abstract A polyomino is an edge-connected set of squares on the square lattice. In this paper, we improve Jensen's algorithm for counting polyominoes by considering bounding boxes on the square lattice rotated by 45o instead of on the regular unrotated lattice. This allows us to extend significantly the count of polyominoes from 56 to 70 terms.
Barequet et al. (Mon,) studied this question.