login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
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.
EXAMPLE
For n = 6 there are two ways to achieve A051602(6) = 2:
XXX
XXX
and
.X.
XXX
XX.
CROSSREFS
Cf. A051602.
Sequence in context: A338664 A199803 A304197 * A210673 A129320 A359556
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Nov 01 2021.
STATUS
approved