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.
%I A296414 #9 Dec 11 2017 17:40:02
%S A296414 1,2,3,6,7,9,2,1,0
%N 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}.
%C A296414 A set of points in R^d is called almost equidistant if for any three points, some two are at unit distance.
%H A296414 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 A296414 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 A296414 Cf. A296415, A296416, A296417, A296418, A296419, A006785.
%K A296414 nonn,fini,full
%O A296414 1,2
%A A296414 _Manfred Scheucher_, Dec 11 2017