|
%I #9 May 28 2019 11:11:04
%S 1,1,1,2,4,1,5,8,4,1,12,34,18,4,1,35,85,61,22,5,1
%N 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.
%C Warning: This appears to be an erroneous version of A308437. - _R. J. Mathar_, May 27 2019
%H Fabian Rothelius, <a href="http://w1.875.telia.com/~u87509703/mathez/polyotessaminoes/polyotessaminonumbers.html">The polyotessamino numbers</a> [broken link?]
%F T(n,1) = A000105(n).
%e 1;
%e 1,1;
%e 2,4,1;
%e 5,8,4,1;
%e 12,34,18,4,1;
%e 35,85,61,22,5,1; ...
%Y Cf. A000105.
%K nonn,tabl
%O 1,4
%A _Fabian Rothelius_, Jan 22 2001
|
