

A003216


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


20



1, 0, 1, 3, 8, 48, 383, 6196, 177083, 9305118, 883156024, 152522187830
(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 SE Conf. Combin., Graph Theory, Computing, Congress. Numer. 8 (1973), 259271.
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..12.
J. P. Dolch, Names of Hamiltonian graphs, Proc. 4th SE Conf. Combin., Graph Theory, Computing, Congress. Numer. 8 (1973), 259271. (Annotated scanned copy of 3 pages)
Scott Garrabrant and Igor Pak, Pattern Avoidance is Not PRecursive, preprint, 2015.
Scott Garrabrant and Igor Pak, Pattern Avoidance is Not PRecursive, arXiv:1505.06508 [math.CO], 2015.
Peter Steinbach, Field Guide to Simple Graphs, Volume 1, Part 17 (For Volumes 1, 2, 3, 4 of this book see A000088, A008406, A000055, A000664, respectively.)
Eric Weisstein's World of Mathematics, Hamiltonian Cycle
Eric Weisstein's World of Mathematics, Hamiltonian Graph


CROSSREFS

Sequence in context: A247033 A291504 A034183 * A146161 A019015 A000862
Adjacent sequences: A003213 A003214 A003215 * A003217 A003218 A003219


KEYWORD

nonn,nice,hard,more


AUTHOR

N. J. A. Sloane.


EXTENSIONS

Extended to n=11 by Brendan McKay, Jul 15 1996
a(12) from Sean A. Irvine, Mar 17 2015


STATUS

approved



