A110148 Number of perfect squared rectangles of order n up to symmetries of the rectangle and of its subrectangles if any.
0, 0, 0, 0, 0, 0, 0, 0, 2, 10, 38, 127, 408, 1375, 4783, 16645, 58059, 203808, 722575
Offset: 1
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(12) and an incorrect value for a(13) on p. 1178.]
- C. J. Bouwkamp, On the construction of simple perfect squared squares, Koninklijke Nederlandsche Akademie van Wetenschappen, Proc., Ser. A, 50 (1947), 1296-1299 (=Indagationes Math., v. 9 (1947), 622-625). [Correct terms up to a(13) on p. 1299.]
- I. M. Yaglom, How to dissect a square? (in Russian), Nauka, Moscow, 1968. In djvu format (1.7M), also as this pdf (9.5M). [Terms up to a(13) on pp. 26-7.]
- Index entries for squared rectangles
- Index entries for squared squares
Crossrefs
Formula
a(n) = a(n-1) + A002839(n) + A002839(n-1) + A217152(n) + A217152(n-1). - Geoffrey H. Morley, Oct 12 2012
Extensions
Definition corrected and a(14)-a(19) added by Geoffrey H. Morley, Oct 12 2012
Comments