cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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).

Original entry on oeis.org

2, 2, 2, 1, 1, 5, 1, 1, 2, 2, 2
Offset: 6

Views

Author

N. J. A. Sloane, Nov 01 2021

Keywords

Comments

For n = 0 through 5 the numbers are 1, 1, oo, oo, 1, oo.

Examples

			For n = 6 there are two ways to achieve A051602(6) = 2:
  XXX
  XXX
and
  .X.
  XXX
  XX.
		

References

  • Sascha Kurz et al., Plane point sets with many squares, draft version, Oct 31 2021.

Crossrefs

Cf. A051602.