OFFSET
1,2
COMMENTS
As pointed out by E. Angelini on the SeqFan list (cf. link), this is the lexicographically earliest sequence of positive integers without repetitions such that the sum of four consecutive terms is always a multiple of 4. - M. F. Hasler, Mar 22 2013
LINKS
E. Angelini, k-chunks sum and division by k, post to the SeqFan list, Mar 22 2013
Index entries for linear recurrences with constant coefficients, signature (0,2,0,-1).
FORMULA
a(n) = (2 - n) * (n - floor(n/2) * 2) + 2 * (n - 1).
G.f.: x*(1+2*x)*(1+x^2)/(1-x^2)^2. - Ralf Stephan, Jun 10 2003
a(2n-1) = 2n-1, a(2n) = 4n-2. - M. F. Hasler, Mar 22 2013
From Wesley Ivan Hurt, Nov 22 2015: (Start)
a(n) = 2*a(n-2) - a(n-4) for n>4.
a(n) = n*(-1)^n/2 - (-1)^n + 3*n/2 - 1. (End)
EXAMPLE
a(1)=1 because n is odd. a(2)=2 because a(1)*2=2.
MAPLE
MATHEMATICA
Flatten[Table[Accumulate[{2 n - 1, 2 n - 1}], {n, 40}]] (* Wesley Ivan Hurt, Nov 22 2015 *)
With[{o=Range[1, 71, 2]}, Riffle[o, 2o]] (* Harvey P. Dale, Sep 17 2019 *)
PROG
(PARI) A043547(n)=n+!bittest(n, 0)*(n-2) \\ M. F. Hasler, Mar 22 2013
(Magma) [n*(-1)^n/2-(-1)^n+3*n/2-1 : n in [1..50]]; // Wesley Ivan Hurt, Nov 22 2015
(PARI) Vec(x*(1+2*x)*(1+x^2)/(1-x^2)^2 + O(x^100)) \\ Altug Alkan, Nov 22 2015
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Jim Cook (jcook(AT)halcyon.com), Mar 01 2000
EXTENSIONS
More terms from James A. Sellers, Mar 01 2000
STATUS
approved