id:A117130 - OEIS Search Results

Search: id:A117130

Displaying 1-1 of 1 results found.

page 1

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
2

0, 0, 0, 1, 7, 37, 197, 1171 (list; graph; listen)

	OFFSET	`0,5`
	COMMENT	`For n <= 6 all cycles can be unknotted and the terms agree with A002807.`
	CROSSREFS	`Cf. A002807.` `Sequence in context: A106925 A085640 A069378 this_sequence A002807 A124610 A002683` `Adjacent sequences: A117127 A117128 A117129 this_sequence A117131 A117132 A117133`
	KEYWORD	`nonn,more`
	AUTHOR	`John Conway, Apr 29 2006`

page 1

Search completed in 0.002 seconds

Last modified December 11 12:57 EST 2009. Contains 170656 sequences.