|
|
A217374
|
|
Number of trivially compound perfect squared rectangles of order n up to symmetries of the rectangle and its subrectangles.
|
|
2
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 16, 60, 194, 622, 2128, 7438, 25852, 90266, 317350, 1127800
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,10
|
|
COMMENTS
|
A squared rectangle is a rectangle dissected into a finite number, two or more, of squares. If no two of these squares have the same size the squared rectangle is perfect. The order of a squared rectangle is the number of constituent squares.
A squared rectangle is simple if it does not contain a smaller squared rectangle, compound if it does, and trivially compound if a constituent square has the same side length as a side of the squared rectangle under consideration.
|
|
LINKS
|
C. J. Bouwkamp, On the dissection of rectangles into squares (Papers I-III), Koninklijke Nederlandsche Akademie van Wetenschappen, Proc., Ser. A, Paper I, 49 (1946), 1176-1188 (=Indagationes Math., v. 8 (1946), 724-736); Paper II, 50 (1947), 58-71 (=Indagationes Math., v. 9 (1947), 43-56); Paper III, 50 (1947), 72-78 (=Indagationes Math., v. 9 (1947), 57-63). [Paper I has terms up to a(13) on p. 1178.]
|
|
FORMULA
|
|
|
CROSSREFS
|
Cf. A217375 (counts symmetries of squared subrectangles as distinct).
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|