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 A007812 #14 Apr 25 2020 03:54:40 %S A007812 0,1,3,2,6,17,33,56,72,88,114,140,160,190,211,250,290,322,356,404,438, %T A007812 474,530,580,626,682,728 %N A007812 Number of n-node Steinhaus graphs whose complements have at least one cut-vertex. %D A007812 W. M. Dymacek, M. Koerlin, T. Whaley, A survey of Steinhaus graphs, Proc. 8th Quadrennial International Conf. on Graph Theory, Combinatorics, Algorithms and Application, Kalamazoo, Mich. 1996, pages 313-323, Vol. I. %H A007812 W. Dymacek, T. Whaley, <a href="https://doi.org/10.1016/0012-365X(93)E0211-L">Generating strings for bipartite Steinhaus graphs</a>, Discrete Math. 141 (1995), pages 97-107. %K A007812 nonn,more %O A007812 1,3 %A A007812 Wayne M. Dymacek (dymacek(AT)fs.sciences.wlu.edu) %E A007812 a(23)-a(27) from _Sean A. Irvine_, Feb 04 2018