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
)
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 1 19:22 EST 2009. Contains 167811 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
