A117130 Maximal number of cycles in complete graph on n nodes that can be unknotted when the graph is embedded in three-dimensional Euclidean space.

0, 0, 0, 1, 7, 37, 197, 1171

Offset

0,5

Comments

For n <= 6 all cycles can be unknotted and the terms agree with A002807.

Links

Table of n, a(n) for n=0..7.

Crossrefs

Cf. A002807.

Sequence in context: A196805 A069378 A287808 * A002807 A124610 A002683

Adjacent sequences: A117127 A117128 A117129 * A117131 A117132 A117133

Keyword

nonn,more

Author

J. H. Conway, Apr 29 2006

Status

approved