login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

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

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.

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.

CROSSREFS

Sequence in context: A047932 A139130 A219087 * A072154 A204206 A080751

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 6 00:38 EST 2016. Contains 278771 sequences.