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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A020878 Number of one-factors in Moebius ladder M_n. 2
2, 3, 3, 6, 7, 13, 18, 31, 47, 78, 123, 201, 322, 523, 843, 1366, 2207, 3573, 5778, 9351, 15127, 24478, 39603, 64081, 103682, 167763, 271443, 439206, 710647, 1149853, 1860498, 3010351, 4870847, 7881198 (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.

FORMULA

if n mod 2 = 0 then L(n) else L(n)+2; fi; where L() are the Lucas numbers.

Empirical G.f.: (2+x-4*x^2-x^3)/((1+x)*(1-x)*(1-x-x^2)). [Colin Barker, Jan 23 2012]

CROSSREFS

A001350(n) + 2.

Sequence in context: A121833 A091606 A027037 * A158278 A187505 A027100

Adjacent sequences:  A020875 A020876 A020877 * A020879 A020880 A020881

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 13 10:53 EST 2012. Contains 205459 sequences.