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

Table of n, a(n) for n=6..16.

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 A320844

Adjacent sequences:  A348765 A348766 A348767 * A348769 A348770 A348771

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 July 1 14:35 EDT 2022. Contains 354973 sequences. (Running on oeis4.)