

A224239


Number of inequivalent ways to cut an n X n square into squares with integer sides.


20



1, 2, 3, 13, 77, 1494, 56978, 4495023, 669203528, 187623057932, 98793520541768, 97702673827558670
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Similar to A045846, but now we do not regard dissections which differ by a rotation and/or reflection as distinct.


LINKS



EXAMPLE

For n=5, the illustrations (see links) show that the 77 solutions consist of:
4 dissections each with 1 image under the group of the square, for a total of 4,
2 dissections each with 2 images under the group of the square, totaling 4,
26 dissections each with 4 images under the group of the square, totaling 104, and
45 dissections each with 8 images under the group of the square, totaling 360,
for a grand total of 77 dissections with 472 images, agreeing with A045846(5) = 472.


CROSSREFS



KEYWORD

nonn,hard,more


AUTHOR



EXTENSIONS



STATUS

approved



