cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A296418 Number of non-isomorphic abstract almost-equidistant graphs on n vertices in R^6. A graph G is abstract almost-equidistant in R^6 if the complement of G does not contain K_3 and G does not contain K_8 nor K_{1,3,3,3}.

This page as a plain text file.
%I A296418 #11 Jun 20 2024 08:27:34
%S A296418 1,2,3,7,14,38,107,409,1888,12064,103333,1217849,19170728
%N A296418 Number of non-isomorphic abstract almost-equidistant graphs on n vertices in R^6. A graph G is abstract almost-equidistant in R^6 if the complement of G does not contain K_3 and G does not contain K_8 nor K_{1,3,3,3}.
%C A296418 A set of points in R^d is called almost equidistant if for any three points, some two are at unit distance.
%H A296418 Martin Balko, Attila Pór, Manfred Scheucher, Konrad Swanepoel, and Pavel Valtr, <a href="https://arxiv.org/abs/1706.06375">Almost-equidistant sets</a>, arXiv:1706.06375 [math.MG], 2017.
%H A296418 Martin Balko, Attila Pór, Manfred Scheucher, Konrad Swanepoel, and Pavel Valtr, <a href="http://page.math.tu-berlin.de/~scheuch/supplemental/almost_equidistant_sets/">Almost-equidistant sets [supplemental data]</a>, 2017.
%Y A296418 Cf. A296414, A296415, A296416, A296417, A006785.
%K A296418 nonn,fini,more
%O A296418 1,2
%A A296418 _Manfred Scheucher_, Dec 11 2017