|
|
A348768
|
|
Number of inequivalent solutions to the problem of the maximal number of squares that can be formed from n points in the plane (see A051602).
|
|
1
|
|
|
2, 2, 2, 1, 1, 5, 1, 1, 2, 2, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
6,1
|
|
COMMENTS
|
For n = 0 through 5 the numbers are 1, 1, oo, oo, 1, oo.
|
|
REFERENCES
|
Sascha Kurz et al., Plane point sets with many squares, draft version, Oct 31 2021.
|
|
LINKS
|
|
|
EXAMPLE
|
For n = 6 there are two ways to achieve A051602(6) = 2:
XXX
XXX
and
.X.
XXX
XX.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|