login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A186705 The maximum number of occurrences of the same distance among n points in the plane. 1
0, 1, 3, 5, 7, 9, 12, 14, 18, 20, 23, 27, 30, 33 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

An upper bound is floor(k*n^(4/3)), A129011 if k is near enough to 1.

a(21)=57.

a(27)=81 (Hamming 3,3 graph). - Ed Pegg Jr, Feb 02 2018

REFERENCES

P. Brass, W. O. J. Moser, J. Pach, Research Problems in Discrete Geometry, Springer (2005), p. 183

LINKS

Table of n, a(n) for n=1..14.

Jean-Paul Delahaye, Les graphes-allumettes, (in French), Pour la Science no. 445, November 2014, pages 108-113. (On page 112, for n=6, drawing 2, one segment is missing.)

Ed Pegg Jr, Maximally Dense Unit Distance Graphs

EXAMPLE

a(4) = 5 because there is a unit distance graph with 4 vertices of an equilateral rhombus such that all but one of the six pairs of vertices are unit distance apart.

Comment from Allan C. Wechsler, Sep 17 2018: (Start)

Construction for a(9)=18: Take a convex, equilateral hexagon ABCDEF. Make the angles vary a bit, though, to avoid the hexagon being regular. Now, on each of the six sides, construct an equilateral triangle pointing into the hexagon. In general, the triangles will overlap here and there; this is OK because we aren't going to care about edges crossing each other. So we have triangles ABU, BCV, CDW, DEX, EFY, and FAZ: a total of twelve points with 18 unit distances among them.

Now adjust the hexagon to make some pairs of the internal points coincide. We want to make U=X, V=Y, and W=Z. The resulting linkage still has one degree of freedom, so we can arrange it so that none of the edges coincide (they can and must cross, though). The adjusted hexagon will only have two different angles: ABC = CDE = EFA, and BCD = DEF = FAB. The whole thing will have triangular (D_6) symmetry. It will have nine vertices (after merging three pairs from the original 12) but it will still have 18 unit edges. (End)

CROSSREFS

Sequence in context: A047932 A139130 A219087 * A072154 A309269 A204206

Adjacent sequences:  A186702 A186703 A186704 * A186706 A186707 A186708

KEYWORD

nonn,hard,more,nice

AUTHOR

Michael Somos, Feb 25 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 May 5 18:37 EDT 2021. Contains 343573 sequences. (Running on oeis4.)