The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A296414 Number of non-isomorphic abstract almost-equidistant graphs on n vertices in R^2. A graph G is abstract almost-equidistant in R^2 if the complement of G does not contain K_3 and G does not contain K_4 nor K_{2,3}. 4
1, 2, 3, 6, 7, 9, 2, 1, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A set of points in R^d is called almost equidistant if for any three points, some two are at unit distance.
LINKS
Martin Balko, Attila Pór, Manfred Scheucher, Konrad Swanepoel, and Pavel Valtr, Almost-equidistant sets, arXiv:1706.06375 [math.MG], 2017.
Martin Balko, Attila Pór, Manfred Scheucher, Konrad Swanepoel, and Pavel Valtr, Almost-equidistant sets [supplemental data], 2017.
CROSSREFS
Sequence in context: A066646 A215488 A110920 * A267590 A145266 A188078
KEYWORD
nonn,fini,full
AUTHOR
Manfred Scheucher, Dec 11 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 20 08:57 EDT 2024. Contains 372710 sequences. (Running on oeis4.)