login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A020873 Number of cycles in Moebius ladder M_n. 0
2, 3, 7, 15, 29, 53, 95, 171, 313, 585, 1115, 2159, 4229, 8349, 16567, 32979, 65777, 131345, 262451, 524631, 1048957, 2097573, 4194767, 8389115, 16777769, 33555033, 67109515, 134218431, 268436213 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

REFERENCES

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

LINKS

Index to sequences with linear recurrences with constant coefficients, signature (5,-9,7,-2). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 31 2010]

FORMULA

2^n+n^2-n+1.

a(n)= +5*a(n-1) -9*a(n-2) +7*a(n-3) -2*a(n-4). G.f.: ( 2-7*x+10*x^2-7*x^3 ) / ( (2*x-1)*(x-1)^3 ). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 31 2010]

MATHEMATICA

Table[2^n+n^2-n+1, {n, 0, 5!}] [From Vladimir Orlovsky (4vladimir(AT)gmail.com), May 07 2010]

CROSSREFS

Sequence in context: A001276 A006884 A074742 * A049958 A177487 A153010

Adjacent sequences:  A020870 A020871 A020872 * A020874 A020875 A020876

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 04:46 EST 2012. Contains 205985 sequences.