A059573 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A059573

Polyotessamino numbers T(n,k) (1<=k<=n): take all the polyominoes with n cells (including those with holes but excluding rotations and reflections); fill them as completely as possible with rectangular 1 X k tiles; T(n,k) is number of ways of doing this.

1, 1, 1, 2, 4, 1, 5, 8, 4, 1, 12, 34, 18, 4, 1, 35, 85, 61, 22, 5, 1

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

1,4

COMMENTS

Warning: This appears to be an erroneous version of A308437. - R. J. Mathar, May 27 2019

LINKS

Table of n, a(n) for n=1..21.

Fabian Rothelius, The polyotessamino numbers [broken link?]

FORMULA

T(n,1) = A000105(n).

EXAMPLE