A003216 - OEIS

This site is supported by donations to The OEIS Foundation.

A003216

Number of Hamiltonian graphs with n nodes.
(Formerly M2764)

1, 0, 1, 3, 8, 48, 383, 6196, 177083, 9305118, 883156024 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,4`
	COMMENTS	`a(1) could also be taken to be 0, but I prefer a(1) = 1. - N. J. A. Sloane (njas(AT)research.att.com), Oct 15 2006`
	REFERENCES	`J. P. Dolch, Names of Hamiltonian graphs, Proc. 4th S-E Conf. Combin., Graph Theory, Computing, Congress. Numer. 8 (1973), 259-271.` `F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 219.` `R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.` `N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).`
	LINKS	`Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.`
	CROSSREFS	`Sequence in context: A019016 A063859 A034183 * A146161 A019015 A000862` `Adjacent sequences: A003213 A003214 A003215 * A003217 A003218 A003219`
	KEYWORD	`nonn,nice,hard`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`
	EXTENSIONS	`Extended to n=11 by Brendan McKay (bdm(AT)cs.anu.edu.au), Jul 15 1996.`

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

Last modified February 16 21:17 EST 2012. Contains 205971 sequences.