login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

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

%I #20 Jan 02 2024 08:54:31

%S 0,0,0,1,3,9,26,78,234,703,2109,6327,18980,56940,170820,512461,

%T 1537383,4612149,13836446,41509338,124528014,373584043,1120752129,

%U 3362256387,10086769160,30260307480,90780922440,272342767321,817028301963,2451084905889,7353254717666

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

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

%F O.g.f.: -x^3/((3*x-1)*(x+1)*(x^2-x+1)) = -(1/28)/(3*x-1)-(1/12)/(x+1)+(1/21)*(-5*x+1)/(x^2-x+1). - _R. J. Mathar_, Nov 28 2007

%t LinearRecurrence[{3, 0, -1, 3}, {0, 0, 0, 1}, 60] (* _Vladimir Joseph Stephan Orlovsky_, Jun 20 2011 *)

%K nonn

%O 0,5

%A _Paul Curtz_, Nov 24 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 10:43 EDT 2024. Contains 371967 sequences. (Running on oeis4.)