|
|
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, 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
|
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
1;
1,1;
2,4,1;
5,8,4,1;
12,34,18,4,1;
35,85,61,22,5,1; ...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|