Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A020878
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A020878 Number of one-factors in Moebius ladder M_n. +0
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; listen)
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.

CROSSREFS

A001350(n) + 2.

Sequence in context: A121833 A091606 A027037 this_sequence A027100 A060840 A074717

Adjacent sequences: A020875 A020876 A020877 this_sequence A020879 A020880 A020881

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 8 18:40 EDT 2008. Contains 141013 sequences.


AT&T Labs Research