cp's OEIS Frontend

A168330 Period 2: repeat [3, -2].

%I A168330 #20 Sep 08 2022 08:45:49
%S A168330 3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,
%T A168330 -2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,
%U A168330 3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2,3,-2
%N A168330 Period 2: repeat [3, -2].
%C A168330 Interleaving of A010701 and -A007395.
%C A168330 Binomial transform of 3 followed by a signed version of A020714.
%C A168330 Inverse binomial transform of 3 followed by A000079.
%C A168330 A084964 without first two terms gives partial sums.
%H A168330 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,1).
%F A168330 a(n) = (-5*(-1)^n + 1)/2.
%F A168330 a(n+1) - a(n) = 5*(-1)^n.
%F A168330 a(n) = -a(n-1) + 1 for n > 1; a(1) = 3.
%F A168330 a(n) = a(n-2) for n > 2; a(1) = 3, a(2) = -2.
%F A168330 G.f.: x*(3 - 2*x)/((1-x)*(1+x)).
%F A168330 a(n) = A049071(n). - _R. J. Mathar_, Nov 25 2009
%F A168330 E.g.f.: (1/2)*(1 - exp(-x))*(5 + exp(x)). - _G. C. Greubel_, Jul 18 2016
%t A168330 LinearRecurrence[{0, 1}, {3, -2}, 25] (* _G. C. Greubel_, Jul 18 2016 *)
%t A168330 PadRight[{},120,{3,-2}] (* _Harvey P. Dale_, Oct 05 2016 *)
%o A168330 (Magma) &cat[[3,-2]: n in [1..42]];
%o A168330 (Magma) [n eq 1 select 3 else -Self(n-1)+1:n in [1..84]];
%o A168330 (Magma) [(-5*(-1)^n+1)/2: n in [1..100]]; // _Vincenzo Librandi_, Jul 19 2016
%o A168330 (PARI) a(n)=3-n%2*5 \\ _Charles R Greathouse IV_, Jul 13 2016
%Y A168330 Cf. A168309 (repeat 4, -3), A010701 (all 3's sequence), A007395 (all 2's sequence), A010716 (all 5's sequence), A020714 (5*2^n), A000079 (powers of 2), A084964 (follow n+2 by n).
%K A168330 sign,easy
%O A168330 1,1
%A A168330 _Klaus Brockhaus_, Nov 23 2009