

A228953


The largest possible element size for each perfect squared square order, otherwise 0 if perfect squared squares do not exist in that order.


0



0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 50, 97, 134, 200, 343, 440, 590, 797, 1045, 1435, 1855, 2505
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,21


COMMENTS

A squared rectangle is a rectangle dissected into a finite number, two or more, of squares, called the elements of the dissection. If no two of these squares have the same size the squared rectangle is called perfect, otherwise it is imperfect. The order of a squared rectangle is the number of constituent squares. The case in which the squared rectangle is itself a square is called a squared square. The dissection is simple if it contains no smaller squared rectangle, otherwise it is compound. Every perfect square with the largest known element for each order up to 32 is simple.


LINKS

Table of n, a(n) for n=1..32.
S. E. Anderson, Perfect Squared Rectangles and Squared Squares
Stuart Anderson, 'Special' Perfect Squared Squares", accessed 2014.  N. J. A. Sloane, Mar 30 2014
Eric Weisstein's World of Mathematics, Perfect Square Dissection


CROSSREFS

Cf. A217149, A129947, A006983.
Sequence in context: A138381 A224551 A262149 * A255585 A260901 A090997
Adjacent sequences: A228950 A228951 A228952 * A228954 A228955 A228956


KEYWORD

nonn


AUTHOR

Stuart E Anderson, Oct 06 2013


STATUS

approved



