Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A158074
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A158074 Number of (directed) Hamiltonian cycles on a 3x(2n) knight's tour graph. +0
3
0, 0, 0, 0, 32, 352, 3072, 30848, 295456, 2896832, 28120096, 273895232, 2664515712, 25931157504, 252338724352, 2455552258304, 23895692937216, 232533011307776, 2262837745837568, 22020130538878208, 214282979451801088 (list; graph; listen)
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 this_sequence A105250 A055752 A125420

Adjacent sequences: A158071 A158072 A158073 this_sequence 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research