

A283825


Number of Hamiltonian regular graphs on n nodes.


0



1, 0, 1, 2, 2, 5, 4, 17, 22, 165, 538, 18972, 389426, 50314715
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,4


COMMENTS

By convention, the singleton graph is generally considered to be both regular (cf. A005176) and Hamiltonian (cf. A003216).  Eric W. Weisstein, Oct 30 2017


LINKS

Table of n, a(n) for n=1..14.
F. Hüffner, tinygraph, software for generating integer sequences based on graph properties.
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 Graph
Eric Weisstein's World of Mathematics, LCF Notation
Eric Weisstein's World of Mathematics, Regular Graph


CROSSREFS

Cf. A005176, A005177.
Sequence in context: A284686 A054079 A210713 * A005177 A253600 A045537
Adjacent sequences: A283822 A283823 A283824 * A283826 A283827 A283828


KEYWORD

nonn,more


AUTHOR

N. J. A. Sloane, Mar 19 2017


EXTENSIONS

a(11)a(14) added using tinygraph by Falk Hüffner, Mar 31 2017
a(1) changed from 0 to 1 by Eric W. Weisstein, Oct 30 2017


STATUS

approved



