The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 1
0, 0, 0, 1, 7, 37, 197, 1171 (list; graph; refs; listen; history; text; internal format)
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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 11 22:48 EDT 2024. Contains 373317 sequences. (Running on oeis4.)