cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A124356 Number of (directed) Hamiltonian cycles on the Moebius ladder graph M_n (for n>=4).

Original entry on oeis.org

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
Offset: 1

Views

Author

Eric W. Weisstein, Nov 05 2006

Keywords

Programs

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