cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Original entry on oeis.org

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

Views

Author

Fabian Rothelius, Jan 22 2001

Keywords

Comments

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

Examples

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

Crossrefs

Cf. A000105.

Formula

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