login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003216 Number of Hamiltonian graphs with n nodes.
(Formerly M2764)
2
1, 0, 1, 3, 8, 48, 383, 6196, 177083, 9305118, 883156024 (list; graph; refs; listen; history; text; 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, 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

Table of n, a(n) for n=1..11.

Eric Weisstein's World of Mathematics, Hamiltonian Graph.

CROSSREFS

Sequence in context: A063859 A210373 A034183 * A146161 A019015 A000862

Adjacent sequences:  A003213 A003214 A003215 * A003217 A003218 A003219

KEYWORD

nonn,nice,hard

AUTHOR

N. J. A. Sloane.

EXTENSIONS

Extended to n=11 by Brendan McKay, Jul 15 1996.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified May 20 11:18 EDT 2013. Contains 225459 sequences.