|
|
A103889
|
|
Odd and even positive integers swapped.
|
|
32
|
|
|
2, 1, 4, 3, 6, 5, 8, 7, 10, 9, 12, 11, 14, 13, 16, 15, 18, 17, 20, 19, 22, 21, 24, 23, 26, 25, 28, 27, 30, 29, 32, 31, 34, 33, 36, 35, 38, 37, 40, 39, 42, 41, 44, 43, 46, 45, 48, 47, 50, 49, 52, 51, 54, 53, 56, 55, 58, 57, 60, 59, 62, 61, 64, 63, 66, 65, 68, 67, 70, 69, 72, 71
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
For n >= 5, also the number of (undirected) Hamiltonian cycles in the (n-2)-Moebius ladder. - Eric W. Weisstein, May 06 2019
For n >= 4, also the number of (undirected) Hamiltonian cycles in the (n-1)-prism graph. - Eric W. Weisstein, May 06 2019
The lexicographically first involution of the natural numbers with no fixed points. - Alexander Fraebel, Sep 08 2020
|
|
LINKS
|
|
|
FORMULA
|
O.g.f.: x*(x^2-x+2)/((x-1)^2*(1+x)). - R. J. Mathar, Apr 06 2008
a(n) = n - (-1)^n.
a(n) - a(n-1) - a(n-2) + a(n-3) = 0 for n > 3.
(a(n) - 1)*(a(n-1) + 1) = 2*A176222(n+1) for n > 1.
(a(n) - 1)*(a(n-3) + 1) = 2*A176222(n) for n > 3. (End)
|
|
MATHEMATICA
|
Table[{n + 1, n}, {n, 1, 100, 2}] // Flatten
|
|
PROG
|
(Magma) [n eq 1 select 2 else -Self(n-1)+2*n-1: n in [1..72]];
(Haskell)
import Data.List (transpose)
a103889 n = n - 1 + 2 * mod n 2
a103889_list = concat $ transpose [tail a005843_list, a005408_list]
(Python)
def a(n): return n+1 if n&1 else n-1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|