login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129349 Number of directed Hamiltonian circuits in the n-triangular graph. 2

%I #25 May 06 2019 20:55:18

%S 0,2,32,6432,19497984,1109403156480,1380937534541660160

%N Number of directed Hamiltonian circuits in the n-triangular graph.

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

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

%K nonn,more

%O 2,2

%A _Eric W. Weisstein_, Apr 10 2007

%E a(6) from _Alois P. Heinz_, Nov 29 2010

%E a(7)-a(8) from _Eric W. Weisstein_, Mar 31 2014

%E Missing factor of 2 applied to a(8) by _Eric W. Weisstein_, Apr 08 2014

%E Offset corrected by _Eric W. Weisstein_, May 06 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 13:38 EDT 2024. Contains 371970 sequences. (Running on oeis4.)