|
| |
|
|
A002962
|
|
Number of simple imperfect squared squares of order n up to symmetry.
(Formerly M2496)
|
|
10
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 3, 5, 15, 19, 57, 72, 274, 491, 1766, 3679, 11158, 24086, 64754, 132598, 326042, 667403, 1627218, 3508516
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,15
|
|
|
COMMENTS
|
A squared rectangle (which may be a square) 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. A squared rectangle is simple if it does not contain a smaller squared rectangle. The order of a squared rectangle is the number of constituent squares. - Geoffrey H. Morley, Oct 17 2012]
Orders 15 to 19 were enumerated by C. J. Bowkamp and A. J. W. Duijvestijn (1962). Orders 20 to 29 were enumerated by Stuart Anderson (2010-2012). Orders 30 to 32 were enumerated by Lorenz Milla and Stuart Anderson (2013). - Stuart E Anderson, Sep 30 2013
|
|
|
REFERENCES
|
C. J. Bouwkamp, personal communication.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
|
A. J. W. Duijvestijn, Electronic Computation of Squared Rectangles, Thesis, Technische Hogeschool, Eindhoven, Netherlands, 1962. Reprinted in Philips Res. Rep., 17 (1962), 523-612. [Pp. 573-4 have simple imperfect squares up to order 19.]
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,hard,nice
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
a(21) and a(22) corrected and terms extended to a(25) by Stuart E Anderson, Apr 24 2011
a(21), a(22), a(25) corrected and a(26)-a(28) added by Stuart E Anderson, Jul 11 2011
|
|
|
STATUS
|
approved
|
| |
|
|
