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 A360630 #17 May 11 2025 14:18:02 %S A360630 1,4,21,192,2035,27407,399618 %N A360630 Number of sets of integer-sided rectangular pieces that can tile an n X n square. %e A360630 The a(3) = 21 possible sets of pieces that can tile a 3 X 3 square are given in the table below. (Each column on the right gives a set of pieces.) %e A360630 . %e A360630 length X width | number of pieces %e A360630 ---------------+------------------------------------------ %e A360630 3 X 3 | 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 %e A360630 2 X 3 | 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 %e A360630 2 X 2 | 0 0 0 0 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 %e A360630 1 X 3 | 0 1 0 0 1 1 0 0 0 3 2 2 1 1 1 1 0 0 0 0 0 %e A360630 1 X 2 | 0 0 1 0 1 0 2 1 0 0 1 0 3 2 1 0 4 3 2 1 0 %e A360630 1 X 1 | 0 0 1 3 0 2 1 3 5 0 1 3 0 2 4 6 1 3 5 7 9 %Y A360630 Main diagonal of A360629. %Y A360630 Cf. A034295 (square pieces). %K A360630 nonn,more %O A360630 1,2 %A A360630 _Pontus von Brömssen_, Feb 14 2023 %E A360630 a(7) from _Robin Visser_, May 09 2025