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 A135515 #11 Aug 29 2020 13:14:57 %S A135515 1,1,1,3,2,10,2,374 %N A135515 Number of inequivalent drawings of the complete graph Kn on n vertices that attain the corresponding rectilinear crossing number (A014540). %C A135515 Some lower bounds: a(13) >= 272, a(14) >= 2, a(15) >= 360, a(16) >= 7, a(17) >= 7532, a(18) >= 2, a(19) >= 069 and a(20) >= 4. %H A135515 O. Aichholzer, F. Aurenhammer and H. Krasser, <a href="https://doi.org/10.1007/s00607-005-0133-3">On the crossing number of complete graphs</a>, Computing, 76:165-176, 2006. [<a href="http://www.ist.tugraz.at/files/publications/geometry/aak-cncg-05.ps.gz">alternative link</a>] %K A135515 nonn,hard,more %O A135515 4,4 %A A135515 Don Pedro Esq. (info(AT)servierlaboratories.org), Feb 09 2008