|
Search: id:A059573
|
|
|
| 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. |
|
+0
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; listen)
|
|
|
OFFSET
|
1,4
|
|
|
LINKS
|
Fabian Rothelius, The polyotessamino numbers
|
|
EXAMPLE
|
1; 1,1; 2,4,1; 5,8,4,1; ...
|
|
CROSSREFS
|
T(n, 1)=a(n) where a(n) is the n-th term of A000105.
Sequence in context: A021418 A094640 A070937 this_sequence A080427 A118906 A085059
Adjacent sequences: A059570 A059571 A059572 this_sequence A059574 A059575 A059576
|
|
KEYWORD
|
more,nonn,tabl
|
|
AUTHOR
|
Fabian Rothelius (fabian.rothelius(AT)telia.com), Jan 22 2001
|
|
|
Search completed in 0.002 seconds
|
