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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
Warning: This appears to be an erroneous version of A308437. - R. J. Mathar, May 27 2019
LINKS
Fabian Rothelius, The polyotessamino numbers [broken link?]
FORMULA
T(n,1) = A000105(n).
EXAMPLE
1;
1,1;
2,4,1;
5,8,4,1;
12,34,18,4,1;
35,85,61,22,5,1; ...
CROSSREFS
Cf. A000105.
Sequence in context: A175036 A177985 A198512 * A308437 A201283 A283739
KEYWORD
nonn,tabl
AUTHOR
Fabian Rothelius, Jan 22 2001
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 10 15:26 EDT 2024. Contains 375056 sequences. (Running on oeis4.)