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 A361219 #5 Mar 11 2023 08:37:58 %S A361219 2,11,56,370,2666,19126,134902,1026667,8049132,60996816,450456500, %T A361219 3427769018,27127841200,211563038980,1837421211974,15474223886906 %N A361219 Maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X 3 rectangle. %C A361219 Tilings that are rotations or reflections of each other are considered distinct. %e A361219 The following table shows the sets of pieces that give the maximum number of tilings for n <= 16. All these sets are unique. %e A361219 \ Number of pieces of size %e A361219 n \ 1 X 1 | 1 X 2 | 1 X 3 | 1 X 4 %e A361219 ----+-------+-------+-------+------ %e A361219 1 | 1 | 1 | 0 | 0 %e A361219 2 | 2 | 2 | 0 | 0 %e A361219 3 | 3 | 3 | 0 | 0 %e A361219 4 | 3 | 3 | 1 | 0 %e A361219 5 | 4 | 4 | 1 | 0 %e A361219 6 | 7 | 4 | 1 | 0 %e A361219 7 | 8 | 5 | 1 | 0 %e A361219 8 | 8 | 5 | 2 | 0 %e A361219 9 | 9 | 6 | 2 | 0 %e A361219 10 | 10 | 7 | 2 | 0 %e A361219 11 | 11 | 8 | 2 | 0 %e A361219 12 | 11 | 8 | 3 | 0 %e A361219 13 | 12 | 9 | 3 | 0 %e A361219 14 | 13 | 8 | 3 | 1 %e A361219 15 | 14 | 9 | 3 | 1 %e A361219 16 | 15 | 10 | 3 | 1 %Y A361219 Third column of A361216. %Y A361219 Cf. A360632, A361225. %K A361219 nonn,more %O A361219 1,1 %A A361219 _Pontus von Brömssen_, Mar 05 2023