|
|
A124356
|
|
Number of (directed) Hamiltonian cycles on the Moebius ladder graph M_n (for n>=4).
|
|
3
|
|
|
2, 8, 6, 12, 10, 16, 14, 20, 18, 24, 22, 28, 26, 32, 30, 36, 34, 40, 38, 44, 42, 48, 46, 52, 50, 56, 54, 60, 58, 64, 62, 68, 66, 72, 70, 76, 74, 80, 78, 84, 82, 88, 86, 92, 90, 96, 94, 100, 98, 104, 102, 108, 106, 112, 110, 116, 114, 120, 118, 124, 122, 128, 126, 132
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
a(n odd) = 2*n, a(n even) = 2*n+4.
a(n) = +1*a(n-1) +1*a(n-2) -1*a(n-3). - Joerg Arndt, Apr 22 2011
G.f.: 2*x*(1+3*x-2*x^2)/((1-x)^2*(1+x)). - Colin Barker, Jan 23 2012
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|