cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A117130 #5 Nov 04 2013 13:17:25
%S A117130 0,0,0,1,7,37,197,1171
%N 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.
%C A117130 For n <= 6 all cycles can be unknotted and the terms agree with A002807.
%Y A117130 Cf. A002807.
%K A117130 nonn,more
%O A117130 0,5
%A A117130 _J. H. Conway_, Apr 29 2006