Center of distances and central cantor sets

We study a recently discovered metric invariant - the center of distances. The center of distances of a nonempty subset A of a metric space (X,d)(X,d) is defined by S(A):={α∈[0,+∞): ∀ x∈A  ∃ y∈Ad(x,y)=α}S(A):={α∈[0,+∞): ∀ x∈A  ∃ y∈Ad(x,y)=α}. Given a nonincreasing sequence (an)(an) of positive numbers converging to 0, the set E(an) := {x∈R: ∃A⊂N  x=∑n∈Aan}E(an) := {x∈R: ∃A⊂N  x=∑n∈Aan} is called the achievement set of the sequence (an)(an). This new invariant is particularly useful in investigating achievability of sets on the real line. We concentrate on computing the centers of distances of central Cantor sets. Any central Cantor set C is an achievement set of exactly one fast convergent series ∑an∑an, and consequently S(C)⊃{0}∪{an:n∈N}S(C)⊃{0}∪{an:n∈N}. We try to check which central Cantor sets have the minimal possible center of distances and which have not.