The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A130707 a(n+3) = 3*(a(n+2) - a(n+1)) + 2*a(n). 3

%I

%S 1,2,2,2,4,10,22,44,86,170,340,682,1366,2732,5462,10922,21844,43690,

%T 87382,174764,349526,699050,1398100,2796202,5592406,11184812,22369622,

%U 44739242,89478484,178956970,357913942,715827884,1431655766,2863311530

%N a(n+3) = 3*(a(n+2) - a(n+1)) + 2*a(n).

%C Binomial transform of period-3 sequence with period 1 1 -1.

%H Harvey P. Dale, <a href="/A130707/b130707.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3, -3, 2).

%F a(n) = 2^n/3 + 4*(-1)^n*(1/3)*cos((2n+1)*Pi/3). - _Emeric Deutsch_, Jul 27 2007

%F From _R. J. Mathar_, Nov 18 2007: (Start)

%F G.f.: (-1+x+x^2)/(2*x-1)/(x^2-x+1).

%F a(n) = (2*A057079(n) + 2^n)/3. (End)

%F a(n) = (1/3)*(1/2 - (1/2)*i*sqrt(3))^n + (1/3)*(1/2 + (1/2)*i*sqrt(3))^n + (1/3)*2^n + (1/3)*i*(1/2 - (1/2)*i*sqrt(3))^n*sqrt(3) - (1/3)*i*(1/2 + (1/2)*i*sqrt(3))^n*sqrt(3), with n >= 0. - _Paolo P. Lava_, May 10 2010

%p a:=proc(n) options operator, arrow: (1/3)*2^n+(4/3)*(-1)^n*cos((1/3)*(2*n+1)*Pi) end proc: seq(a(n), n = 0 .. 33); # _Emeric Deutsch_, Jul 27 2007

%t RecurrenceTable[{a[0]==1,a[1]==a[2]==2,a[n]==3(a[n-1]-a[n-2])+2a[n-3]},a,{n,40}] (* or *) LinearRecurrence[{3,-3,2},{1,2,2},40] (* _Harvey P. Dale_, Jan 18 2015 *)

%K nonn

%O 0,2

%A _Paul Curtz_, Jul 01 2007

%E More terms from _Emeric Deutsch_, Jul 27 2007

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.

Last modified January 20 08:07 EST 2020. Contains 331081 sequences. (Running on oeis4.)