Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A020875
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A020875 Number of Hamiltonian paths in Moebius ladder M_n. +0
1
0, 4, 12, 36, 72, 140, 228, 364, 528, 756, 1020, 1364, 1752, 2236, 2772, 3420, 4128, 4964, 5868, 6916, 8040, 9324, 10692, 12236, 13872, 15700, 17628, 19764, 22008, 24476, 27060, 29884, 32832, 36036, 39372 (list; graph; listen)
OFFSET

0,2

REFERENCES

J. P. McSorley, Counting structures in the Moebius ladder, Discrete Math., 184 (1998), 137-164.

FORMULA

if n mod 2 = 0 then n^3+2*n else n^3+3*n; fi.

CROSSREFS

Sequence in context: A053595 A062858 A095735 this_sequence A063810 A002842 A051041

Adjacent sequences: A020872 A020873 A020874 this_sequence A020876 A020877 A020878

KEYWORD

nonn

AUTHOR

njas

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research