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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A234365 Number of directed Hamiltonian cycles in the complete tripartite graph K_{n,n,n}. 3
2, 32, 3168, 926208, 598579200, 723105792000, 1464887918592000, 4610898301943808000, 21308780838537658368000, 138404291567096011161600000, 1220304754650628950589440000000, 14197926030549494380143575040000000, 212919452788134597593544586690560000000, 4034887005978635554837074343530332160000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Eric Weisstein's World of Mathematics, Complete Tripartite Graph
Eric Weisstein's World of Mathematics, Hamiltonian Cycle
FORMULA
a(n) = n!^2 * (n-1)! * A141147(n) = n!^2 * (n-1)! * (A000172(n-1)+A000172(n)) * 2 / 3.
MATHEMATICA
Table[n!^2 (n - 1)! 2^n HypergeometricPFQ[{n, (1 - n)/2, -n/2}, {1, 1}, 1], {n, 10}] (* Eric W. Weisstein, Apr 26, 2017 *)
CROSSREFS
Sequence in context: A329928 A093584 A117259 * A068183 A166077 A053853
KEYWORD
nonn
AUTHOR
Max Alekseyev, Dec 25 2013
STATUS
approved

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 December 3 21:20 EST 2023. Contains 367540 sequences. (Running on oeis4.)