The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #7 Nov 01 2021 19:23:14
%S 2,2,2,1,1,5,1,1,2,2,2
%N 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).
%C For n = 0 through 5 the numbers are 1, 1, oo, oo, 1, oo.
%D Sascha Kurz et al., Plane point sets with many squares, draft version, Oct 31 2021.
%e For n = 6 there are two ways to achieve A051602(6) = 2:
%e XXX
%e XXX
%e and
%e .X.
%e XXX
%e XX.
%Y Cf. A051602.
%K nonn,more
%O 6,1
%A _N. J. A. Sloane_, Nov 01 2021.