id:A096267 - OEIS Search Results

Search: id:A096267

Displaying 1-1 of 1 results found.

page 1

Number of fixed polyedges with n edges (number of ways of embedding connected undirected graphs with n edges into the plane square lattice, inequivalent up to translation).

+0
1

2, 6, 22, 88, 372, 1628, 7312, 33466, 155446, 730534, 3466170, 16576874, 79810756, 386458826, 1880580352, 9190830700, 45088727820, 221945045488, 1095798917674, 5424898610958, 26922433371778 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Found using the rooted method (also known as Redelmeier's algorithm).`
	REFERENCES	`Alexander Malkis, "Polyedges, polyominoes and the 'Digit' game", diploma thesis in computer science, Universitaet des Saarlandes, Germany`
	LINKS	`Alexander Malkis, Polyedges, polyominoes and the 'Digit' game`
	EXAMPLE	`_\|_\|_ is a polyedge with 5 edges`
	CROSSREFS	`Cf. A019988 for "free" polyedges.` `Sequence in context: A049135 A049127 A049137 this_sequence A150264 A107944 A150265` `Adjacent sequences: A096264 A096265 A096266 this_sequence A096268 A096269 A096270`
	KEYWORD	`nonn`
	AUTHOR	`Alexander Malkis (alexmalk(AT)face.cs.uni-sb.de), Jun 22 2004`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research