login
A243576
Denominator of largest minimal l^1 distance for n points in the simplex x+y+z=1, 0<=x,y,z<=1.
1
1, 1, 3, 1, 1, 5, 4, 3, 3, 5, 7, 15, 2, 2, 21, 13, 9, 9
OFFSET
2,3
COMMENTS
a(n) is the denominator (in lowest terms) of the maximum of min(|x_i-x_j| + |y_i-y_j| + |z_i-z_j|, 1 <= i < j <= n) where x_i, y_i, z_i >= 0, x_i + y_i + z_i = 1 for 1<=i<=n.
LINKS
Robert Israel, A packing problem
Robert Israel, A packing problem [Cached version, pdf format, with permission]
FORMULA
For n=3 an optimal configuration consists of [1,0,0],[0,1,0],[0,0,1], with all distances 2, so a(3) = 1.
CROSSREFS
Numerator is A243487(n).
Sequence in context: A209421 A320435 A275421 * A211314 A026703 A122917
KEYWORD
nonn,frac
AUTHOR
Robert Israel, Jun 06 2014
EXTENSIONS
More terms from Robert Israel, Jun 22 2014
STATUS
approved