906545760

Appears in sequences

• Number of (undirected) Hamiltonian cycles in the binary n-cube, or the number of cyclic n-bit Gray codes.at n=4A066037
• Triangle T(n,k) read by rows: T(n,k) = number of cycles of length 2k in the binary n-cube, for n >= 2, k = 2, 3, ..., 2^(n-1).at n=25A085452
• Number of canonical Gray cycles of length 2n.at n=15A236602