login
Number of largest subsets of the set of points in an n X n square grid, such that no two points are at the same distance.
4

%I #66 Jul 04 2022 04:35:35

%S 1,6,40,184,280,16,8,26800,4376,416,16,27488,536,587640,10192,128

%N Number of largest subsets of the set of points in an n X n square grid, such that no two points are at the same distance.

%H Ehit Dinesh Agarwal, <a href="/A335232/a335232.c.txt">C program</a>

%H P. Erdős and R. K. Guy, <a href="http://dx.doi.org/10.5169/seals-27359">Distinct distances between lattice points</a>, Elemente der Mathematik 25 (1970), 121-123.

%H Matt Parker, <a href="https://www.youtube.com/watch?v=M_YOCQaI5QI">MPMP: Unique Distancing Problem</a>, Youtube video, May 2020.

%H Giovanni Resta, <a href="/A335232/a335232.pdf">The essentially unique 7 x 7 configuration</a>

%Y Cf. A193838, A193839.

%Y Size of largest subset in A271490.

%Y Cf. A351699 (generalization to grid rectangles, counting congruent configurations only once).

%K nonn,more,hard

%O 1,2

%A _Ehit Dinesh Agarwal_, May 27 2020

%E a(14)-a(16) from _Fausto A. C. Cariboni_, Jul 03 2022