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.
%I A348768 #9 Jul 09 2025 04:57:03 %S A348768 2,2,2,1,1,5,1,1,2,2,2 %N 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). %C A348768 For n = 0 through 5 the numbers are 1, 1, oo, oo, 1, oo. %D A348768 Sascha Kurz et al., Plane point sets with many squares, draft version, Oct 31 2021. %e A348768 For n = 6 there are two ways to achieve A051602(6) = 2: %e A348768 XXX %e A348768 XXX %e A348768 and %e A348768 .X. %e A348768 XXX %e A348768 XX. %Y A348768 Cf. A051602. %K A348768 nonn,more %O A348768 6,1 %A A348768 _N. J. A. Sloane_, Nov 01 2021