A134489 -id:A134489 - cp's OEIS frontend

A100334 An inverse Catalan transform of Fibonacci(2n).

0, 1, 2, 2, 0, -5, -13, -21, -21, 0, 55, 144, 233, 233, 0, -610, -1597, -2584, -2584, 0, 6765, 17711, 28657, 28657, 0, -75025, -196418, -317811, -317811, 0, 832040, 2178309, 3524578, 3524578, 0, -9227465, -24157817, -39088169, -39088169, 0, 102334155, 267914296, 433494437, 433494437, 0, -1134903170

Offset: 0

Paul Barry, Nov 17 2004

G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (3,-4,2,-1).

Cf. A001906, A109466.

Cf. A102312 (F(5n)), A134489 (F(5n+2)), A134490 (F(5n+3)).

I:=[0,1,2,2]; [n le 4 select I[n] else 3*Self(n-1) -4*Self(n-2) +2*Self(n-3) -Self(n-4): n in [1..41]]; // G. C. Greubel, Jan 30 2023

Table[FullSimplify[GoldenRatio^n*Sqrt[2/5 + 2*Sqrt[5]/25]*Sin[Pi*n/5 + Pi/5] - (1/GoldenRatio)^n*Sqrt[2/5 - 2*Sqrt[5]/25]*Sin[2*Pi*n/5 + 2*Pi/5]], {n, 0, 41}] (* Arkadiusz Wesolowski, Oct 26 2012 *)
LinearRecurrence[{3,-4,2,-1}, {0,1,2,2}, 41] (* G. C. Greubel, Jan 30 2023 *)

def A100334(n): return sum((-1)^k*binomial(n-k,k)*fibonacci(2*n-2*k) for k in range(1+(n//2)))
[A100334(n) for n in range(41)] # G. C. Greubel, Jan 30 2023

G.f.: x*(1-x)/(1-3*x+4*x^2-2*x^3+x^4).
a(n) = (phi)^n*sqrt(2/5+2*sqrt(5)/25)*sin(Pi*(n+1)/5) -(1/phi)^n*sqrt(2/5-2*sqrt(5)/25)*sin(2*Pi*(n+1)/5), where phi=(1+sqrt(5))/2;
a(n) = Sum_{k=0..floor(n/2)} (C(n-k, k)*(-1)^k*Sum_{j=0..n-k} C(n-k, j)*F(j));
a(n) = Sum_{k=0..floor(n/2)} C(n-k, k)*(-1)^k*Fibonacci(2n-2k).
a(n) = 3*a(n-1)-4*a(n-2)+2*a(n-3)-a(n-4). - Paul Curtz, May 13 2008
a(n) = Sum_{k=0..n} A109466(n,k)*A001906(k). - Philippe Deléham, Oct 30 2008
a(5*n) = -F(-5*n), a(5*n+1) = -F(-5*n-2), a(5*n+2) = a(5*n+3) = F(-5*n-3), a(5*n+4) = 0. - Ehren Metcalfe, Apr 04 2019

A138110 Table T(d,n) read column by column: the n-th term in the sequence of the d-th differences of A138112, d=0..4.

Original entry on oeis.org

0, 0, 0, 1, -1, 0, 0, 1, 0, -1, 0, 1, 1, -1, -1, 1, 2, 0, -2, -1, 3, 2, -2, -3, 0, 5, 0, -5, -3, 3, 5, -5, -8, 0, 8, 0, -13, -8, 8, 13, -13, -21, 0, 21, 13, -34, -21, 21, 34, 0, -55, 0, 55, 34, -34, -55, 55, 89, 0, -89, 0, 144, 89, -89, -144, 144, 233, 0, -233, -144, 377, 233, -233, -377, 0, 610, 0, -610, -377, 377

Offset: 0

Paul Curtz, May 04 2008

Ignoring signs, the sequence contains A000045(2)=1 ten times and each of the following Fibonacci numbers A000045(i>2) four times.

			All 5 rows of the table T(d,n) are:
.0,.0,.0,.1,.3,.5,.5,..0,-13,-34,-55,-55,...0,.144,...
.0,.0,.1,.2,.2,.0,-5,-13,-21,-21,..0,.55,.144,.233,...
.0,.1,.1,.0,-2,-5,-8,.-8,..0,.21,.55,.89,..89,...0,...
.1,.0,-1,-2,-3,-3,.0,..8,.21,.34,.34,..0,.-89,-233,...
-1,-1,-1,-1,.0,.3,.8,.13,.13,..0,-34,-89,-144,-144,...

Cf. A102312 (A049666), A099100, A134489, A134490, A134491.

T(0,n)=A138112(n). T(d,n)= T(d-1,n+1)-T(d-1,n), d=1..4.
T(1,n)=A100334(n-1). T(2,n)=A103311(n). T(3,n) = -A138003(n-2). T(4,n)= -A105371(n).
sum_(d=0..4) T(d,n)=0 (columns sum to zero).

Edited by R. J. Mathar, Jul 04 2008

cp's OEIS Frontend

A100334 An inverse Catalan transform of Fibonacci(2n).

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

Formula

A138110 Table T(d,n) read column by column: the n-th term in the sequence of the d-th differences of A138112, d=0..4.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

Extensions