id:A019988 - OEIS Search Results

Search: id:A019988

Displaying 1-1 of 1 results found.

page 1

Number of ways of embedding a connected graph with n edges in the square lattice.

+0
3

1, 2, 5, 16, 55, 222, 950, 4265, 19591, 91678, 434005, 2073783, 9979772, 48315186, 235088794, 1148891118, 5636168859 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`Ed Pegg, Jr., Illustrations of polyforms` `M. Keller, Counting polyforms` `Eric Weisstein's World of Mathematics, Polyedge [From Eric W. Weisstein (eric(AT)weisstein.com), Apr 24 2009]`
	CROSSREFS	`Sequence in context: A149972 A026106 A066642 this_sequence A137732 A057973 A102461` `Adjacent sequences: A019985 A019986 A019987 this_sequence A019989 A019990 A019991`
	KEYWORD	`nonn,nice,hard`
	AUTHOR	`Russ Cox (rsc(AT)swtch.com)`
	EXTENSIONS	`More terms from Brendan Owen (brendan_owen(AT)yahoo.com), Feb 20 2002`

page 1

Search completed in 0.002 seconds

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.