id:A122223 - OEIS Search Results

Search: id:A122223

Displaying 1-1 of 1 results found.

page 1

Length of the longest possible self avoiding path on the 2-dimensional honeycomb net such that the path fits into a circle of diameter n.

+0
7

1, 6, 6, 12, 15, 23, 33, 42, 53, 62, 74, 90, 103 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`The path may be open or closed. For larger n several solutions with the same number of segments exist. An upper bound for the number of segments is given by A127406(n).`
	LINKS	`Hugo Pfoertner, Examples of compact self avoiding paths on a honeycomb net.`
	CROSSREFS	`Cf. A122224, A122226, A127406.` `Adjacent sequences: A122220 A122221 A122222 this_sequence A122224 A122225 A122226` `Sequence in context: A127402 A124691 A112437 this_sequence A046625 A029682 A014201`
	KEYWORD	`hard,more,nonn`
	AUTHOR	`Hugo Pfoertner (hugo(AT)pfoertner.org), Sep 25 2006, Feb 11 2007`

page 1

Search completed in 0.002 seconds

Last modified October 12 11:50 EDT 2008. Contains 144830 sequences.