OFFSET
0,1
COMMENTS
a(n) = automorphism group order for the complete bipartite graph K_{n,n}. - Avi Peretz (njk(AT)netvision.net.il), Feb 21 2001
For n > 1, also the order of automorphism group for the n X n rook graph. - Eric W. Weisstein, Jun 20 2017
Also the number of (directed) Hamiltonian paths in K_{n,n}. - Eric W. Weisstein, Jul 15 2011
For n>=1, a(n) is the number of ways to arrange n men and n women in a line so that no two people of the same gender are adjacent. - Geoffrey Critzer, Aug 24 2013
Also the number of (directed) Hamiltonian paths in the (n+1)-barbell graph. - Eric W. Weisstein, Dec 16 2013
LINKS
Eric Weisstein's World of Mathematics, Graph Automorphism
Eric Weisstein's World of Mathematics, Barbell Graph
Eric Weisstein's World of Mathematics, Complete Bipartite Graph
Eric Weisstein's World of Mathematics, Hamiltonian Path
Eric Weisstein's World of Mathematics, Rook Graph
FORMULA
a(n) = 2*A001044(n)
MAPLE
seq(mul(n!*k!, k=1..2), n=0..17); # Zerinvary Lajos, Jul 01 2007
MATHEMATICA
2(Range[0, 20]!)^2 (* Harvey P. Dale, Jun 21 2011 *)
Table[2 (n!)^2, {n, 0, 20}] (* Vincenzo Librandi, Feb 22 2016 *)
PROG
(Magma) [2*Factorial(n)^2: n in [0..30]]; // Vincenzo Librandi, Feb 22 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved