%I A001186
%S A001186 1,2,5,17,80,474,3841,39635,495991,7170657
%N A001186 Number of cubic Hamiltonian graphs with 2n nodes.
%D A001186 McKay, Brendan D.; Royle, Gordon F.; Constructing the cubic graphs on 
               up to 20 vertices. Thirteenth Australasian conference on combinatorial 
               mathematics and computing (Sydney, 1985). Ars Combin. 21 (1986), 
               A, 129-140.
%H A001186 Roman Maurer, <a href="http://www.ijp.si/vega/HtmlDoc/MANUAL/HAMCUB2.HTM">
               Counting small hamiltonian cubic graphs</a>.
%Y A001186 Sequence in context: A014288 A020096 A054499 this_sequence A125282 A020125 
               A076322
%Y A001186 Adjacent sequences: A001183 A001184 A001185 this_sequence A001187 A001188 
               A001189
%K A001186 nonn,hard,nice
%O A001186 2,2
%A A001186 Martin Harborth (Martin.Harborth(AT)vt.siemens.de)
%E A001186 One more term from Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 02 2007