Equilateral triangles in finite metric spaces

In the context of finite metric spaces with integer distances, we investigate the new Ramsey-type question of how many points can a space contain and yet be free of equilateral triangles. In particular, for finite metric spaces with distances in the set {1,..., n}, the number D-n is defined as the least number of points the space must contain in order to be sure that there will be an equilateral triangle in it. Several issues related to these numbers are studied, mostly focusing on low values of n. Apart from the trivial D-1 = 3, D-2 = 6, we prove that D-3 = 12, D-4 = 33 and 81 less than or equal to D-5 less than or equal to 95.