A283825 - OEIS

%I #20 Feb 16 2025 08:33:43

%S 1,0,1,2,2,5,4,17,22,165,538,18972,389426,50314715

%N Number of Hamiltonian regular graphs on n nodes.

%C By convention, the singleton graph is generally considered to be both regular (cf. A005176) and Hamiltonian (cf. A003216). - _Eric W. Weisstein_, Oct 30 2017

%H F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties.

%H Peter Steinbach, <a href="/A000088/a000088_17.pdf">Field Guide to Simple Graphs, Volume 1</a>, Part 17 (For Volumes 1, 2, 3, 4 of this book see A000088, A008406, A000055, A000664, respectively.)

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/HamiltonianGraph.html">Hamiltonian Graph</a>

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/LCFNotation.html">LCF Notation</a>

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/RegularGraph.html">Regular Graph</a>

%Y Cf. A005176, A005177.

%K nonn,more,changed

%O 1,4

%A _N. J. A. Sloane_, Mar 19 2017

%E a(11)-a(14) added using tinygraph by _Falk Hüffner_, Mar 31 2017

%E a(1) changed from 0 to 1 by _Eric W. Weisstein_, Oct 30 2017