Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A020874
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A020874 Number of paths in Moebius ladder M_n. +0
1
0, 3, 30, 135, 452, 1295, 3378, 8295, 19560, 44847, 100790, 223223, 488940, 1061775, 2289882, 4910535, 10480208, 22275695, 47178270, 99605847, 209704980, 440390223, 922733570, 1929364775, 4026514872 (list; graph; listen)
OFFSET

0,2

REFERENCES

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

FORMULA

10*n*2^n-n^3-5*n^2-11*n.

CROSSREFS

Sequence in context: A035328 A100259 A031205 this_sequence A161806 A003689 A127868

Adjacent sequences: A020871 A020872 A020873 this_sequence A020875 A020876 A020877

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research