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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

Vincenzo Librandi, Table of n, a(n) for n = 1..10000

Eric Weisstein's World of Mathematics, Hamiltonian Cycle

Eric Weisstein's World of Mathematics, Moebius Ladder

Index entries for linear recurrences with constant coefficients, signature (1,1,-1).

FORMULA

a(n odd) = 2*n, a(n even) = 2*n+4.

a(n) = 2(n+1)+2(-1)^n. - Paul Barry, Feb 17 2008

a(n) -a(n-4) = 8. - Paul Curtz, Apr 19 2011

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

a(n) = 2*A014681(n+1). - R. J. Mathar, Nov 27 2015

PROG

(MAGMA) [2*(n+1)+2*(-1)^n: n in [1..70]]; // Vincenzo Librandi, Aug 11 2011

CROSSREFS

Sequence in context: A065473 A054029 A197589 * A277249 A320262 A019186

Adjacent sequences:  A124353 A124354 A124355 * A124357 A124358 A124359

KEYWORD

nonn,easy

AUTHOR

Eric W. Weisstein, Nov 05 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 13 20:57 EST 2019. Contains 329106 sequences. (Running on oeis4.)