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

%I #5 Nov 04 2013 13:17:25

%S 0,0,0,1,7,37,197,1171

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

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

%Y Cf. A002807.

%K nonn,more

%O 0,5

%A _J. H. Conway_, Apr 29 2006