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!)
A138003 Binomial transform of 1, 1, 0, -1, -1 (periodically continued). 4

%I #16 Dec 05 2023 09:22:32

%S 1,2,3,3,0,-8,-21,-34,-34,0,89,233,377,377,0,-987,-2584,-4181,-4181,0,

%T 10946,28657,46368,46368,0,-121393,-317811,-514229,-514229,0,1346269,

%U 3524578,5702887,5702887,0,-14930352,-39088169,-63245986,-63245986

%N Binomial transform of 1, 1, 0, -1, -1 (periodically continued).

%C Shares many elements with A103311, as already indicated by the similarity of the two generating functions. First differences are essentially in A105371. - _R. J. Mathar_, May 02 2008

%C The longer of the two recurrences ensures that the sequence (like A133476) equals its 5th differences. - _R. J. Mathar_, May 02 2008

%H Paolo Xausa, <a href="/A138003/b138003.txt">Table of n, a(n) for n = 0..1000</a>

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

%F From _R. J. Mathar_, May 02 2008: (Start)

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

%F a(n) = 5a(n-1)-10a(n-2)+10a(n-3)-5a(n-4)+2a(n-5).

%F a(n) = 3a(n-1)-4a(n-2)+2a(n-3)-a(n-4). (End)

%t LinearRecurrence[{3,-4,2,-1},{1,2,3,3},50] (* _Paolo Xausa_, Dec 05 2023 *)

%o (PARI) a=[1,2,3,3];for(i=1,99,a=concat(a,3*a[#a]-4*a[#a-1]+2*a[#a-2]-a[#a-3]));a \\ _Charles R Greathouse IV_, Jun 02 2011

%Y Cf. A129929.

%K sign,easy

%O 0,2

%A _Paul Curtz_, May 01 2008

%E Edited by _R. J. Mathar_, May 02 2008

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 18 21:51 EDT 2024. Contains 371781 sequences. (Running on oeis4.)