%I #11 Aug 29 2020 13:14:57
%S 1,1,1,3,2,10,2,374
%N Number of inequivalent drawings of the complete graph Kn on n vertices that attain the corresponding rectilinear crossing number (A014540).
%C 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 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 nonn,hard,more
%O 4,4
%A Don Pedro Esq. (info(AT)servierlaboratories.org), Feb 09 2008