# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a296417 Showing 1-1 of 1 %I A296417 #10 Jun 20 2024 08:28:16 %S A296417 1,2,3,7,14,38,106,402,1817,11132,86053,803299,7623096,58770989 %N A296417 Number of non-isomorphic abstract almost-equidistant graphs on n vertices in R^5. A graph G is abstract almost-equidistant in R^5 if the complement of G does not contain K_3 and G does not contain K_7 nor K_{3,3,3}. %C A296417 A set of points in R^d is called almost equidistant if for any three points, some two are at unit distance. %H A296417 Martin Balko, Attila Pór, Manfred Scheucher, Konrad Swanepoel, and Pavel Valtr, Almost-equidistant sets, arXiv:1706.06375 [math.MG], 2017. %H A296417 Martin Balko, Attila Pór, Manfred Scheucher, Konrad Swanepoel, and Pavel Valtr, Almost-equidistant sets [supplemental data], 2017. %Y A296417 Cf. A296414, A296415, A296416, A296418, A006785. %K A296417 nonn,fini,more %O A296417 1,2 %A A296417 _Manfred Scheucher_, Dec 11 2017 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE