login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
Cf. A051602.
Sequence in context: A338664 A199803 A304197 * A210673 A129320 A359556
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Nov 01 2021.
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 22:36 EDT 2024. Contains 371917 sequences. (Running on oeis4.)