The number of non-isomorphic drawings of the complete graph K_n such that any two edges intersect at most once (a.k.a. "good drawings" or "simple topological graphs").

A276109

The number of non-isomorphic drawings of the complete graph K_n such that any two edges intersect at most once (a.k.a. "good drawings" or "simple topological graphs").

Terms

    a(0) =1a(1) =2a(2) =5a(3) =121a(4) =46999a(5) =502090394

External references