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