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 A361225 #5 Mar 11 2023 08:38:24 %S A361225 1,5,8,95,682,4801,33807 %N A361225 Maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X 3 rectangle, up to rotations and reflections. %e A361225 The following table shows the sets of pieces that give the maximum number of tilings for n <= 7. The solutions are unique except for n = 1 and n = 3. %e A361225 \ Number of pieces of size %e A361225 n \ 1 X 1 | 1 X 2 | 1 X 3 %e A361225 ---+-------+-------+------ %e A361225 1 | 3 | 0 | 0 %e A361225 1 | 1 | 1 | 0 %e A361225 1 | 0 | 0 | 1 %e A361225 2 | 2 | 2 | 0 %e A361225 3 | 3 | 3 | 0 %e A361225 3 | 2 | 2 | 1 %e A361225 4 | 3 | 3 | 1 %e A361225 5 | 4 | 4 | 1 %e A361225 6 | 7 | 4 | 1 %e A361225 7 | 8 | 5 | 1 %e A361225 It seems that all optimal solutions for A361219 are also optimal here, but for n = 1 and n = 3 there are other optimal solutions. %Y A361225 Third column of A361221. %Y A361225 Cf. A361219, A360632. %K A361225 nonn,more %O A361225 1,2 %A A361225 _Pontus von Brömssen_, Mar 05 2023