A007342 - OEIS

This site is supported by donations to The OEIS Foundation.

A007342

Complexity of a 2 X n grid.
(Formerly M3502)

1, 4, 15, 59, 209, 780 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	REFERENCES	`G. Kreweras, Complexite et circuits Euleriens dans la sommes tensorielles de graphes, J. Combin. Theory, B 24 (1978), 202-212.` `N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).`
	CROSSREFS	`Sequence in context: A160156 A102052 A128714 * A017951 A199210 A129155` `Adjacent sequences: A007339 A007340 A007341 * A007343 A007344 A007345`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`
	EXTENSIONS	`Probably an erroneous version of A001353.`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 12:25 EST 2012. Contains 205786 sequences.