Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137886
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137886 Number of (directed) Hamiltonian paths in the n-crown graph. +0
1
12, 144, 3840, 138240, 6804000, 436504320, 35417088000, 3546005299200, 429451518988800, 61883150757120000, 10463789706751180800 (list; graph; listen)
OFFSET

3,1

LINKS

Max Alekseyev, PARI/GP Scripts for Miscellaneous Math Problems

Eric Weisstein's World of Mathematics, Hamiltonian Path

Eric Weisstein's World of Mathematics, Crown Graph

PROGRAM

(PARI) { A137886(n) = nhp( matrix(2*n, 2*n, i, j, if(min(i, j)<=n && max(i, j)>n && abs(j-i)!=n, 1, 0)) ) }

CROSSREFS

Sequence in context: A123237 A143248 A138444 this_sequence A097303 A067219 A075619

Adjacent sequences: A137883 A137884 A137885 this_sequence A137887 A137888 A137889

KEYWORD

nonn,more

AUTHOR

E. W. Weisstein (eric(AT)weisstein.com), Feb 20, 2008

EXTENSIONS

More terms from Max Alekseyev (maxale(AT)gmail.com), Feb 13 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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research