OFFSET
0,2
COMMENTS
A graph is Hamiltonian if it contains a cycle passing through every vertex exactly once.
FORMULA
a(n) = A326208(n) * 2^n.
EXAMPLE
The a(3) = 8 edge-sets:
{12,13,23} {11,12,13,23} {11,12,13,22,23} {11,12,13,22,23,33}
{12,13,22,23} {11,12,13,23,33}
{12,13,23,33} {12,13,22,23,33}
MATHEMATICA
Table[Length[Select[Subsets[Select[Tuples[Range[n], 2], OrderedQ]], FindHamiltonianCycle[Graph[Range[n], #]]!={}&]], {n, 0, 5}]
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Jun 17 2019
STATUS
approved