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!)
A111571 a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4. 5

%I #19 Mar 11 2024 08:11:17

%S 1,1,-2,-1,1,0,-3,-3,-2,-5,-11,-16,-23,-39,-66,-105,-167,-272,-443,

%T -715,-1154,-1869,-3027,-4896,-7919,-12815,-20738,-33553,-54287,

%U -87840,-142131,-229971,-372098,-602069,-974171,-1576240,-2550407,-4126647,-6677058,-10803705

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

%C See comment and FAMP code for A111569.

%C Floretion Algebra Multiplication Program, FAMP Code: 1jesseq[B+H] with B = - .25'i + .25'j - .25i' + .25j' + k' - .5'kk' - .25'ik' - .25'jk' - .25'ki' - .25'kj' - .5e and H = + .75'ii' + .75'jj' + .75'kk' + .75e

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

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

%t LinearRecurrence[{1,0,1,1},{1,1,-2,-1},40] (* or *) CoefficientList[ Series[ (-1+3*x^2)/((1+x^2)*(x^2+x-1)),{x,0,40}],x] (* _Harvey P. Dale_, Apr 23 2011 *)

%Y Cf. A001638, A111569, A111570, A111572, A111573, A007598, A000045.

%K easy,sign

%O 0,3

%A _Creighton Dement_, Aug 10 2005

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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)