A131628 - OEIS

This site is supported by donations to The OEIS Foundation.

A131628

Maximal size of an n-distance set in the plane.

1, 3, 5, 7, 9, 12 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,2`
	COMMENTS	`A set of points in the plane is called an n-distance set if there are precisely n different distances between pairs of distinct points.` `A186704( a(n) ) = n and a(n) is the maximum value for which this is true. - Michael Somos Feb 25 2011`
	REFERENCES	`J. H. Conway and N. J. A. Sloane, Lattices with Few Distances, J. Number Theory, 39 (1991), pp. 75-90 [a related paper]` `P. Erdos and P. Fishburn, Maximum planar sets that determine k distances, Discrete Math. 160 (1996), 115-125.` `M. Shinohara, Uniqueness of maximimum planar five-distance sets, Discrete Math., 308 (2008), 3048-3055.`
	EXAMPLE	`a(n) = 2n + 1 for n = 0 to 4 which comes from the 2n + 1 vertices of a regular polygon.`
	CROSSREFS	`Sequence in context: A046497 A061512 A083964 * A079091 A191749 A038663` `Adjacent sequences: A131625 A131626 A131627 * A131629 A131630 A131631`
	KEYWORD	`nonn,more`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), May 29 2008`
	EXTENSIONS	`This may be in the OEIS already - with so few terms it is hard to be sure. - N. J. A. Sloane (njas(AT)research.att.com), May 29 2008`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 08:58 EST 2012. Contains 205614 sequences.