login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A135515 Number of inequivalent drawings of the complete graph Kn on n vertices that attain the corresponding rectilinear crossing number (A014540). 0
1, 1, 1, 3, 2, 10, 2, 374 (list; graph; refs; listen; history; text; internal format)
OFFSET

4,4

COMMENTS

Some lower bounds: a(12) >=, 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

LINKS

Table of n, a(n) for n=4..11.

O. Aichholzer, F. Aurenhammer and H. Krasser, On the crossing number of complete graphs., Computing, 76:165-176, 2006.

CROSSREFS

Sequence in context: A234744 A092502 A292923 * A114486 A176743 A220466

Adjacent sequences:  A135512 A135513 A135514 * A135516 A135517 A135518

KEYWORD

hard,more,nonn

AUTHOR

Don Pedro Esq. (info(AT)servierlaboratories.org), Feb 09 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 24 06:53 EDT 2019. Contains 323529 sequences. (Running on oeis4.)