Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A020877
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A020877 Number of matchings in Moebius ladder M_n. +0
1
10, 34, 106, 344, 1102, 3546, 11394, 36628, 117730, 378426, 1216378, 3909832, 12567446, 40395794, 129844994, 417363332, 1341539194, 4312135922, 13860583626, 44552347608, 143205490526, 460308235562, 1479577849602 (list; graph; listen)
OFFSET

2,1

REFERENCES

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

FORMULA

G.f.=2x^2*(5+7x-x^2-2x^3)/[(1+x)(1-3x-x^2+x^3)]. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 21 2004

The McSorley reference gives the approximation a(n)~(3.2143)^n+(-0.6751)^n+(0.4608)^n-(-1)^n. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 21 2004

MAPLE

G:=2*x^2*(5+7*x-x^2-2*x^3)/(1+x)/(1-3*x-x^2+x^3): Gser:=series(G, x=0, 29): seq(coeff(Gser, x^n), n=2..27); (Deutsch)

CROSSREFS

Sequence in context: A007584 A009924 A019257 this_sequence A119171 A119229 A119227

Adjacent sequences: A020874 A020875 A020876 this_sequence A020878 A020879 A020880

KEYWORD

nonn,easy

AUTHOR

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

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 21 2004

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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research