|
%I #27 Jul 13 2022 08:33:25
%S 1,5,5,5,5365,205,1885,117925,3445,97,2225,62530,284345,461,146605
%N Numerators of the squared radii of the smallest enclosing circles of n points with integer coordinates and distinct mutual distances, arranged such that the radius of their enclosing circle is minimized. Denominators are given in A193556.
%C Finding optimal solutions of this problem has been the topic of a round of Al Zimmermann's programming contests from July to October 2009, entitled "Point Packing".
%C Conjectured next terms are a(17)/A193556(17)=19720/121, a(18)/A193556(18)=5002/25.
%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 H. Lefmann and T. Thiele, <a href="https://www.semanticscholar.org/paper/SERIE-B-INFORMATIK-Point-Sets-with-Distinct-Thiele/0db6784a38705ef16a56328c3c84cd1399fc7bc0">Point sets with distinct distances</a>, Serie B Informatik, B 94-16, 1994.
%H H. Lefmann and T. Thiele, <a href="https://dx.doi.org/10.1007/BF01299744">Point sets with distinct distances</a>, Combinatorica (1995) 15: 379.
%Y Cf. A193556 (corresponding denominators), A193839.
%Y Cf. A193838 (similar problem for smallest enclosing square).
%K nonn,frac,hard,more
%O 2,2
%A _Hugo Pfoertner_, Jul 30 2011
|
