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]
Robert Israel, Illustration for a(17), with caption
Robert Israel, Illustration for a(17), without caption
Math Overflow, What is the most ``diverse'' k-subset of [0,1]^m?
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
KEYWORD
nonn,frac
AUTHOR
Robert Israel, Jun 06 2014
EXTENSIONS
More terms from Robert Israel, Jun 22 2014
STATUS
approved