login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A158074 Number of (directed) Hamiltonian cycles on a 3x(2n) knight's tour graph. 2
0, 0, 0, 0, 32, 352, 3072, 30848, 295456, 2896832, 28120096, 273895232, 2664515712, 25931157504, 252338724352, 2455552258304, 23895692937216, 232533011307776, 2262837745837568, 22020130538878208, 214282979451801088 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

LINKS

Eric Weisstein's World of Mathematics, Knight's Tour

CROSSREFS

Equals 2*A070030(n). Cf. A070030 for details and references [From Eric W. Weisstein (eric(AT)weisstein.com), Mar 18 2009]

Sequence in context: A145402 A009797 A006763 * A200531 A105250 A191901

Adjacent sequences:  A158071 A158072 A158073 * A158075 A158076 A158077

KEYWORD

nonn

AUTHOR

E. W. Weisstein (eric(AT)weisstein.com), Mar 13, 2009

EXTENSIONS

Extended by Eric W. Weisstein (eric(AT)weisstein.com), Mar 18 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 05:39 EST 2012. Contains 205860 sequences.