login
A307930
Number of (undirected) Hamiltonian circuits in the n-triangular graph.
0
0, 0, 1, 16, 3216, 9748992, 554701578240, 690468767270830080
OFFSET
2,4
LINKS
Eric Weisstein's World of Mathematics, Hamiltonian Cycle
Eric Weisstein's World of Mathematics, Triangular Graph
FORMULA
a(n) = A129349(n)/2.
CROSSREFS
Cf. A129349.
Sequence in context: A049030 A223068 A051551 * A289703 A266824 A249599
KEYWORD
nonn,more,hard
AUTHOR
Eric W. Weisstein, May 06 2019
STATUS
approved