login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A193839 Smallest possible value of the maximum of squared distances between any two out of n points with integer coordinates and distinct mutual distances. 3
1, 5, 10, 20, 37, 50, 73, 100 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,2

COMMENTS

Upper bounds for next terms are a(10)<=148, a(11)<=193.

LINKS

Table of n, a(n) for n=2..9.

EXAMPLE

Configurations minimizing the maximum distance between 2 points:

a(2)=1: ((0,0),(0,1)), dist^2={1}

a(3)=5: ((0,0),(0,1)),(1,2), dist^2={1,2,5}

a(4)=10: ((0,0),(0,1),(2,1),(3,0)), dist^2={1,2,4,5,9,10}

a(5)=20: ((0,1),(1,0),(2,4),(3,2),(3,4)), dist^2={1,2,4,5,8,10,13,17,18,20}

a(6)=37: ((0,1),(1,1),(2,2),(4,2),(4,5),(6,0)), dist^2={1,2,4,5,8,9,10,13,17,20,25,26,29,32,37}

a(7)=50: (( 0,5),(1,2),(1,4),(3,0),(3,5),(7,4),(7,5)), dist^2={1,2,4,5,8,9,10,13,16,17,20,25,32,34,36,37,40,41,45,49,50}

CROSSREFS

Cf. A193838, A193555, A193556 configurations minimizing radius of enclosing circle.

Sequence in context: A117518 A107486 A210677 * A323831 A020714 A146523

Adjacent sequences:  A193836 A193837 A193838 * A193840 A193841 A193842

KEYWORD

nonn,hard,more

AUTHOR

Hugo Pfoertner, Aug 06 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 13 20:38 EDT 2019. Contains 327981 sequences. (Running on oeis4.)