A080144 -id:A080144 - cp's OEIS frontend

A202453 Fibonacci self-fusion matrix, by antidiagonals.

1, 1, 1, 2, 2, 2, 3, 3, 3, 3, 5, 5, 6, 5, 5, 8, 8, 9, 9, 8, 8, 13, 13, 15, 15, 15, 13, 13, 21, 21, 24, 24, 24, 24, 21, 21, 34, 34, 39, 39, 40, 39, 39, 34, 34, 55, 55, 63, 63, 64, 64, 63, 63, 55, 55, 89, 89, 102, 102, 104, 104, 104, 102, 102, 89, 89, 144, 144, 165, 165

Offset: 1

Clark Kimberling, Dec 19 2011

The Fibonacci self-fusion matrix, F, is the fusion P**Q, where P and Q are the lower and upper triangular Fibonacci matrices.  See A193722 for the definition of fusion of triangular arrays.
Every term F(n,k) of F is a product of two Fibonacci numbers; indeed,
F(n,k)=F(n)*F(k+1) if k is even;
F(n,k)=F(n+1)*F(k) if k is odd.
antidiagonal sums: (1,2,6,12,...), A054454
diagonal (1,2,6,15,...), A001654
diagonal (1,3,9,24,...), A064831
diagonal (2,5,15,39,..), A059840
diagonal (3,8,24,63,..), A080097
diagonal (5,13,39,102,...), A080143
diagonal (8,21,63,165,...), A080144
principal submatrix sums, A202462
All the principal submatrices are invertible, and the terms in the inverses are in {-3,-2,-1,0,1,2,3}.

			Northwest corner:
1...1....2....3....5....8....13
1...2....3....5....8...13....21
2...3....6....9...15...24....39
3...5....9...15...24...39....63
5...8...15...24...40...64...104

Clark Kimberling, Fusion, Fission, and Factors, Fib. Q., 52 (2014), 195-202.

Cf. A000045, A202451, A202452, A202503 (Fibonacci fission array).

n = 12;
Q = NestList[Most[Prepend[#, 0]] &, #, Length[#] - 1] &[Table[Fibonacci[k], {k, 1, n}]];
P = Transpose[Q]; F = P.Q;
Flatten[Table[P[[i]][[k + 1 - i]], {k, 1, n}, {i, 1, k}]] (* A202452 as a sequence *)
Flatten[Table[Q[[i]][[k + 1 - i]], {k, 1, n}, {i, 1, k}]] (* A202451 as a sequence *)
Flatten[Table[F[[i]][[k + 1 - i]], {k, 1, n}, {i, 1, k}]] (* A202453 as a sequence *)
TableForm[Q]  (* A202451, upper tri. Fibonacci array *)
TableForm[P]  (* A202452, lower tri. Fibonacci array *)
TableForm[F]  (* A202453, Fibonacci fusion array *)
TableForm[FactorInteger[F]]

Matrix product P*Q, where P, Q are the lower and upper triangular Fibonacci matrices, A202451 and A202452.

A080097 a(n) = Fibonacci(n+2)^2 - 1.

Original entry on oeis.org

0, 3, 8, 24, 63, 168, 440, 1155, 3024, 7920, 20735, 54288, 142128, 372099, 974168, 2550408, 6677055, 17480760, 45765224, 119814915, 313679520, 821223648, 2149991423, 5628750624, 14736260448, 38580030723, 101003831720

Offset: 0

Mario Catalani (mario.catalani(AT)unito.it), Jan 29 2003

a(n), a(n)+1 and a(n)+2 are consecutive members of A049997.

G. C. Greubel, Table of n, a(n) for n = 0..1000
Sergio Falcon, On the Sequences of Products of Two k-Fibonacci Numbers, American Review of Mathematics and Statistics, March 2014, Vol. 2, No. 1, pp. 111-120.
Index entries for linear recurrences with constant coefficients, signature (3,0,-3,1).

Equals A007598(n+2) - 1.

Cf. A000032, A000045, A001622, A049997, A059840, A064831, A080144.

List([0..30], n-> Fibonacci(n+2)^2 -1); # G. C. Greubel, Jul 23 2019

[Fibonacci(n+2)^2 -1: n in [0..30]]; // G. C. Greubel, Jul 23 2019

CoefficientList[Series[(3x+2x^2-x^3)/((1-x^2)(1-2x-2x^2+x^3)), {x, 0, 30}], x]
Table[Fibonacci[n+2]^2-1,{n,0,30}] (* Vladimir Joseph Stephan Orlovsky, Apr 03 2011 *)
LinearRecurrence[{3,0,-3,1},{0,3,8,24},40] (* Harvey P. Dale, Nov 23 2024 *)

A080097(n):=fib(n+2)^2-1$ makelist(A080097(n),n,0,30); /* Martin Ettl, Nov 13 2012 */

a(n)=fibonacci(n+2)^2-1 \\ Charles R Greathouse IV, Feb 06 2013

[fibonacci(n+2)^2 -1 for n in (0..30)] # G. C. Greubel, Jul 23 2019

If n is odd, then a(n) = F(n+1)*F(n+3) = F(n)*F(n+4) - 2, else a(n) = F(n)*F(n+4) = F(n+1)*F(n+3) - 2, where F(n) = Fibonacci numbers (A000045).
a(n) = (Lucas(2*n+4) - 2*(-1)^n - 5)/5.
O.g.f.: x*(3-x)/((1-x^2)*(1-3*x+x^2)) (see a comment on A080144). - Wolfdieter Lang, Jul 30 2012
a(n) = Sum_{k=1..n} F(k+3)*F(k) = A027941(n) + 2*A001654(n), n>=0. - Wolfdieter Lang, Jul 27 2012
Sum_{n>=1} 1/a(n) = (43 - 15*sqrt(5))/18 = 29/9 - 5*phi/3, where phi is the golden ratio (A001622). - Amiram Eldar, Oct 20 2020
a(n) = 3*a(n-1) - 3*a(n-3) + a(n-4). - Joerg Arndt, Nov 13 2023

Edited by Ralf Stephan, May 15 2005

A059840 a(n) = F(n)F(n-1) if n odd otherwise F(n)F(n-1)-1, where F = Fibonacci numbers A000045.

Original entry on oeis.org

0, 0, 2, 5, 15, 39, 104, 272, 714, 1869, 4895, 12815, 33552, 87840, 229970, 602069, 1576239, 4126647, 10803704, 28284464, 74049690, 193864605, 507544127, 1328767775, 3478759200, 9107509824, 23843770274, 62423800997, 163427632719, 427859097159, 1120149658760, 2932589879120

Offset: 1

N. J. A. Sloane, Feb 26 2001

Harry J. Smith, Table of n, a(n) for n = 1..500
S. Falcon, On the Sequences of Products of Two k-Fibonacci Numbers, American Review of Mathematics and Statistics, March 2014, Vol. 2, No. 1, pp. 111-120.
H. Ohtsuka and S. Nakamura, On the sum of reciprocal sums of Fibonacci numbers, Fibonacci Quart. 46/47 (2008/2009), 153-159.
Index entries for linear recurrences with constant coefficients, signature (3,0,-3,1).

Cf. A000045, A001654, A059248, A064831, A119996.

List([1..30],n->Sum([1..n-2],k->Fibonacci(k)*Fibonacci(k+2))); # Muniru A Asiru, Aug 09 2018

F:=Fibonacci; [(n mod 2) eq 0 select F(n)*F(n-1)-1 else F(n)*F(n-1): n in [1..30]]; // G. C. Greubel, Jul 23 2019

seq(coeff(series(x^3*(2-x)/((1-x^2)*(1-3*x+x^2)), x,n+1),x,n),n=1..30); # Muniru A Asiru, Aug 09 2018

Table[If[OddQ[n],Fibonacci[n]Fibonacci[n-1],Fibonacci[n] Fibonacci[n-1]-1],{n,30}]  (* Harvey P. Dale, Apr 20 2011 *)

a(n) = { fibonacci(n)*fibonacci(n-1) - (n%2 == 0) } \\ Harry J. Smith, Jun 29 2009

a=(x^3*(2-x)/((1-x^2)*(1-3*x+x^2))).series(x, 30).coefficients(x, sparse=False); a[1:] # G. C. Greubel, Jul 23 2019

G.f.: x^3*(2 - x)/((1 - x^2)*(1 - 3*x + x^2)). See a comment on A080144. - Wolfdieter Lang, Jul 30 2012
a(n) = Sum_{k=1..n-2} F(k)*F(k+2). - Alexander Adamchuk, May 17 2007
a(n+2) = (3*A001654(n) + A027941(n))/2, n >= 0. - Wolfdieter Lang, Jul 21 2012
a(n+2) = (3*(-1)^(n+1) - 5 + 2*Lucas(2*n + 3))/10, n >= 0. - Ehren Metcalfe, Aug 21 2017
a(n) = floor(1/(Sum_{k>=n} 1/Fibonacci(k)^2)) [Ohtsuka and Nakamura]. - Michel Marcus, Aug 09 2018
For n > 2, 2 * A000217(a(n)) = A228873(n-2). - Diego Rattaggi, Jan 27 2021

A080143 a(n) = F(3)F(n)F(n+1) + F(4)F(n+1)^2 - F(4) if n even, F(3)F(n)F(n+1) + F(4)F(n+1)^2 if n odd, where F(n) is the n-th Fibonacci number (A000045).

Original entry on oeis.org

0, 5, 13, 39, 102, 272, 712, 1869, 4893, 12815, 33550, 87840, 229968, 602069, 1576237, 4126647, 10803702, 28284464, 74049688, 193864605, 507544125, 1328767775, 3478759198, 9107509824, 23843770272, 62423800997, 163427632717

Offset: 0

Mario Catalani (mario.catalani(AT)unito.it), Jan 30 2003

G. C. Greubel, Table of n, a(n) for n = 0..1000
S. Falcon, On the Sequences of Products of Two k-Fibonacci Numbers, American Review of Mathematics and Statistics, March 2014, Vol. 2, No. 1, pp. 111-120.
Index entries for linear recurrences with constant coefficients, signature (3,0,-3,1).

Cf. A064831, A059840, A080097, A080144.

F:=Fibonacci;; List([0..30], n-> (2*F(n+2)*F(n+3) -3 -(-1)^n)/2); # G. C. Greubel, Jul 23 2019

F:=Fibonacci; [(2*F(n+2)*F(n+3) -3 -(-1)^n)/2: n in [0..30]]; // G. C. Greubel, Jul 23 2019

CoefficientList[Series[x*(5+3*x-2*x^2)/((1-x^2)*(1-2*x-2*x^2+x^3)), {x, 0, 30}], x]
With[{F=Fibonacci}, Table[(2*F[n+2]*F[n+3] -3 -(-1)^n)/2, {n,0,30}]] (* G. C. Greubel, Jul 23 2019 *)

my(x='x+O('x^30)); concat([0], Vec(x*(5+3*x-2*x^2)/((1-x^2)*(1- 2*x-2*x^2+x^3)))) \\ G. C. Greubel, Mar 05 2017

vector(30, n, n--; f=fibonacci; (2*f(n+2)*f(n+3) -3 -(-1)^n)/2) \\ G. C. Greubel, Jul 23 2019

f=fibonacci; [(2*f(n+2)*f(n+3) -3 -(-1)^n)/2 for n in (0..30)] # G. C. Greubel, Jul 23 2019

G.f.: x*(5-2*x)/((1-x^2)*(1-3*x+x^2)), see a comment on A080144 for A(4,x). - Wolfdieter Lang, Jul 30 2012
a(n) = Sum_{i=0..n} ( A000045(i+4)*A000045(i) ). - Benoit Cloitre, Jun 14 2004
a(n) = (3*A027941(n) + 7*A001654(n))/2, n >= 0. Proof: from the preceding sum given by B. Cloitre via recurrence on the first factor under the sum. See also A080097 and A059840(n+2). - Wolfdieter Lang, Jul 27 2012
a(n) = (2*Lucas(2*n + 5) + 7*(-1)^(n+1) - 15)/10. - Ehren Metcalfe, Aug 21 2017
a(n) = (2*Fibonacci(n+2)*Fibonacci(n+3) - 3 - (-1)^n)/2. - G. C. Greubel, Jul 23 2019

A202503 Fibonacci self-fission matrix, by antidiagonals.

Original entry on oeis.org

1, 1, 2, 2, 3, 3, 3, 5, 5, 5, 5, 8, 9, 8, 8, 8, 13, 14, 15, 13, 13, 13, 21, 23, 24, 24, 21, 21, 21, 34, 37, 39, 39, 39, 34, 34, 34, 55, 60, 63, 64, 63, 63, 55, 55, 55, 89, 97, 102, 103, 104, 102, 102, 89, 89, 89, 144, 157, 165, 167, 168, 168, 165, 165, 144, 144, 144

Offset: 1

Clark Kimberling, Dec 20 2011

The Fibonacci self-fission matrix, F, is the fission P^^Q, where P and Q are the matrices given at A202502 and A202451.  See A193842 for the definition of fission.
antidiagonal sums:  (1, 3, 8, 18, 38, ...), A064831
diagonal (1,  5, 14,  39, ...), A119996
diagonal (2,  8, 23,  63, ...), A180664
diagonal (2,  5, 15,  39, ...), A059840
diagonal (3,  8, 24,  63, ...), A080097
diagonal (5, 13, 39, 102, ...), A080143
diagonal (8, 21, 63, 165, ...), A080144
All the principal submatrices are invertible, and the terms in the inverses are in {-3,-2,-1,0,1,2,3}.

			Northwest corner:
1....1....2....3....5.....8....13...21
2....3....5....8...13....21....34...55
3....5....9...14...23....37....60...97
5....8...15...24...39....63...102...165
8...13...24...39...64...103...167...270

Clark Kimberling, Fusion, Fission, and Factors, Fib. Q., 52 (2014), 195-202.

Cf. A000045, A202451, A202453, A202502.

n = 14;
Q = NestList[Most[Prepend[#, 0]] &, #, Length[#] - 1] &[Table[Fibonacci[k], {k, 1, n}]];
Qt = Transpose[Q]; P1 = Qt - IdentityMatrix[n];
P = P1[[Range[2, n], Range[1, n]]];
F = P.Q;
Flatten[Table[P[[i]][[k + 1 - i]], {k, 1, n - 1}, {i, 1, k}]] (* A202502 as a sequence *)
Flatten[Table[Q[[i]][[k + 1 - i]], {k, 1, n - 1}, {i, 1, k}]] (* A202451 as a sequence *)
Flatten[Table[F[[i]][[k + 1 - i]], {k, 1, n - 1}, {i, 1, k}]] (* A202503 as a sequence *)
TableForm[P]  (* A202502, modified lower triangular Fibonacci array *)
TableForm[Q]  (* A202451, upper tri. Fibonacci array *)
TableForm[F]  (* A202503, Fibonacci fission array *)

A193917 Triangular array: the self-fusion of (p(n,x)), where p(n,x)=sum{F(k+1)*x^(n-k) : 0<=k<=n}, where F=A000045 (Fibonacci numbers).

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 2, 3, 6, 9, 3, 5, 9, 15, 24, 5, 8, 15, 24, 40, 64, 8, 13, 24, 39, 64, 104, 168, 13, 21, 39, 63, 104, 168, 273, 441, 21, 34, 63, 102, 168, 272, 441, 714, 1155, 34, 55, 102, 165, 272, 440, 714, 1155, 1870, 3025, 55, 89, 165, 267, 440, 712, 1155

Offset: 0

Clark Kimberling, Aug 09 2011

See A193722 for the definition of fusion of two sequences of polynomials or triangular arrays.  (Fusion is defined at A193822; fission, at A193742; see A202503 and A202453 for infinite-matrix representations of fusion and fission.)
First five rows of P (triangle of coefficients of polynomials p(n,x)):
1
1...1
1...1...2
1...1...2...3
1...1...2...3...5
First eight rows of A193917:
1
1...1
1...2...3
2...3...6...9
3...5...9...15...24
5...8...15..24...40...64
8...13..24..39...64...104..168
13..21..39..63...104..168..273..441
...
col 1:  A000045
col 2:  A000045
col 3:  A022086
col 4:  A022086
col 5:  A022091
col 6:  A022091
col 7:  A022355
col 8:  A022355
right edge, w(n,n):  A064831
w(n,n-1):  A001654
w(n,n-2):  A064831
w(n,n-3):  A059840
w(n,n-4):  A080097
w(n,n-5):  A080143
w(n,n-6):  A080144
Suppose n is an even positive integer and w(n+1,x) is the polynomial matched to row n+1 of A193917 as in the Mathematica program (and definition of fusion at A193722), where the first row is counted as row 0.

			First six rows:
1
1...1
1...2...3
2...3...6....9
3...5...9....15...24
5...8...15...24...40...64

Cf. A193722, A064831, A193918, A194000, A194001.

z = 12;
p[n_, x_] := Sum[Fibonacci[k + 1]*x^(n - k), {k, 0, n}];
q[n_, x_] := p[n, x];
t[n_, k_] := Coefficient[p[n, x], x^k]; t[n_, 0] := p[n, x] /. x -> 0;
w[n_, x_] := Sum[t[n, k]*q[n + 1 - k, x], {k, 0, n}]; w[-1, x_] := 1
g[n_] := CoefficientList[w[n, x], {x}]
TableForm[Table[Reverse[g[n]], {n, -1, z}]]
Flatten[Table[Reverse[g[n]], {n, -1, z}]]  (* A193917 *)
TableForm[Table[g[n], {n, -1, z}]]
Flatten[Table[g[n], {n, -1, z}]]  (* A193918 *)

A194000 Triangular array: the self-fission of (p(n,x)), where sum{F(k+1)*x^(n-k) : 0<=k<=n}, where F=A000045 (Fibonacci numbers).

Original entry on oeis.org

1, 2, 3, 3, 5, 9, 5, 8, 15, 24, 8, 13, 24, 39, 64, 13, 21, 39, 63, 104, 168, 21, 34, 63, 102, 168, 272, 441, 34, 55, 102, 165, 272, 440, 714, 1155, 55, 89, 165, 267, 440, 712, 1155, 1869, 3025, 89, 144, 267, 432, 712, 1152, 1869, 3024, 4895, 7920, 144, 233

Offset: 0

Clark Kimberling, Aug 11 2011

See A193917 for the self-fusion of the same sequence of polynomials.  (Fusion is defined at A193822; fission, at A193842; see A202503 and A202453 for infinite-matrix representations of fusion and fission.)
...
First five rows of P (triangle of coefficients of polynomials p(n,x)):
1
1...1
1...1...2
1...1...2...3
1...1...2...3...5
First eight rows of A194000:
1
2....3
3....5....9
5....8....15...24
8....13...24...39...64
13...21...29...63...104...168
21...34...63...102..168...272...441
34...55...102..165..272...440...714..1155
...
col 1:  A000045
col 2:  A000045
col 3:  A022086
col 4:  A022086
col 5:  A022091
col 6:  A022091
right edge, d(n,n):  A064831
d(n,n-1):  A059840
d(n,n-2):  A080097
d(n,n-3):  A080143
d(n,n-4):  A080144
...
Suppose n is an odd positive integer and d(n+1,x) is the polynomial matched to row n+1 of A194000 as in the Mathematica program (and definition of fission at A193842), where the first row is counted as row 0.

			First six rows:
1
2....3
3....5....9
5....8....15...24
8....13...24...39...64
13...21...29...63...104...168
...
Referring to the matrix product for fission at A193842,
the row (5,8,15,24) is the product of P(4) and QQ, where
P(4)=(p(4,4), p(4,3), p(4,2), p(4,1))=(5,3,2,1); and
QQ is the 4x4 matrix
(1..1..2..3)
(0..1..1..2)
(0..0..1..1)
(0..0..0..1).

Cf. A193842, A194001, A193917, A193918.

z = 11;
p[n_, x_] := Sum[Fibonacci[k + 1]*x^(n - k), {k, 0, n}];
q[n_, x_] := p[n, x];
p1[n_, k_] := Coefficient[p[n, x], x^k];
p1[n_, 0] := p[n, x] /. x -> 0;
d[n_, x_] := Sum[p1[n, k]*q[n - 1 - k, x], {k, 0, n - 1}]
h[n_] := CoefficientList[d[n, x], {x}]
TableForm[Table[Reverse[h[n]], {n, 0, z}]]
Flatten[Table[Reverse[h[n]], {n, -1, z}]]  (* A194000 *)
TableForm[Table[h[n], {n, 0, z}]]
Flatten[Table[h[n], {n, -1, z}]]  (* A194001 *)

A214729 Member m=6 of the m-family of sums b(m,n) = Sum_{k=0..n} F(k+m)*F(k), m >= 0, n >= 0, with the Fibonacci numbers F.

Original entry on oeis.org

0, 13, 34, 102, 267, 712, 1864, 4893, 12810, 33550, 87835, 229968, 602064, 1576237, 4126642, 10803702, 28284459, 74049688, 193864600, 507544125, 1328767770, 3478759198, 9107509819, 23843770272, 62423800992, 163427632717, 427859097154, 1120149658758

Offset: 0

Wolfdieter Lang, Jul 27 2012

See the comment section on A080144 for the general formula and the o.g.f. for b(m,n).

Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (3,0,-3,1).

Cf. A001654, A027941, A059840(n+2), A064831, A080097, A080143 and A080144 for the m=0,1,...,5 members.

Cf. A027941.

[(9*(-1)^(n+1)-20+Lucas(2*n+7))/5: n in [0..40]]; // Vincenzo Librandi, Aug 26 2017

With[{m = 6}, Table[Sum[Fibonacci[k + m]*Fibonacci[k], {k, 0, n}], {n, 0, 25}]] (* or *)
Table[(9 (-1)^(n + 1) - 20 + LucasL[2 n + 7])/5, {n, 0, 25}] (* Michael De Vlieger, Aug 23 2017 *)
LinearRecurrence[{3,0,-3,1},{0,13,34,102},40] (* Harvey P. Dale, Jun 13 2022 *)

concat(0, Vec(x*(13 - 5*x) / ((1 - x)*(1 + x)*(1 - 3*x + x^2)) + O(x^30))) \\ Colin Barker, Aug 25 2017

[fibonacci(n+3)*fibonacci(n+4) - 2*(2+(-1)^n) for n in range(41)] # G. C. Greubel, Dec 31 2023

a(n) = b(6,n) = 4*A027941(n) + 9*A001654(n), with A027941(n) = Fibonacci(2*n+1) - 1 and A001654(n) = Fibonacci(n+1)*Fibonacci(n), n >= 0. 4 = Fibonacci(6)/2 and 9 = LucasL(6)/2.
O.g.f.: x*(13-5*x)/((1-x^2)*(1-3*x+x^2)) (see a comment above). - Wolfdieter Lang, Jul 30 2012
a(n) = (9*(-1)^(n+1) - 20 + Lucas(2*n + 7))/5. - Ehren Metcalfe, Aug 21 2017
From Colin Barker, Aug 25 2017: (Start)
a(n) = (1/10)*((29 - 13*sqrt(5))*((3 - sqrt(5))/2)^n + (29 + 13*sqrt(5))*((3 + sqrt(5))/2)^n - 2*(20 + 9*(-1)^n) ).
a(n) = 2*a(n-1) + 2*a(n-2) + 2*a(n-3) - a(n-4) for n>3. (End)
a(n) = A001654(n+3) - 2*(2 + (-1)^n). - G. C. Greubel, Dec 31 2023

A214884 a(n) = Sum_{k=0..n} (-1)^kF(k)F(k+2), where F=A000045 (Fibonacci numbers).

Original entry on oeis.org

0, -2, 1, -9, 15, -50, 118, -324, 831, -2195, 5725, -15012, 39276, -102854, 269245, -704925, 1845483, -4831574, 12649186, -33116040, 86698875, -226980647, 594243001, -1555748424, 4073002200, -10663258250, 27916772473, -73087059249, 191344405191

Offset: 0

Wolfdieter Lang, Jul 30 2012

The present sequence is the m=2 member of the m-family of sequences b(m,n):=Sum_{k=0..n} (-1)^k*F(k+2)*F(k) given by b(m,n) = (L(m)*A119283(n) + F(m)*(-1)^n*A001654(n))/2, with A119283(n) = b(0,n) = ((-1)^n*F(2*n+1) - (2*n+1))/5 and A001654(n) = F(n+1)*F(n), where F and L are the Fibonacci and Lucas numbers, A000045 and A000032, respectively.
The o.g.f. of b(m,n) is A(m,x) = -(1/2)*x*(F(m+1) + F(m-1)*x)/((1-x)^2*(1+3*x+x^2)), m >= 0, with F(-1) = 1. For the unsigned sums see a comment on A080144.
b(m, n) = ((-1)^n*F(m + 2*n + 1) - n*L(m) - F(m + 1))/5. - Ehren Metcalfe, Aug 21 2017

Cf. A119283, -A077916(n-1) for the m=0 and m=1 cases. A214885 for m=3.

Table[Sum[(-1)^k*Fibonacci[k]*Fibonacci[k + 2], {k, 0, n}], {n, 0, 28}] (* Michael De Vlieger, Aug 23 2017 *)

a(n) = b(2,n) = (3*A119283(n) + (-1)^n*A001654(n))/2, n >= 0.
O.g.f.: -x*(2+x)/((1-x)^2*(1+3*x+x^2)) (see the comment section).
a(n) = ((-1)^n*Fibonacci(2*n + 3) - 3*n - 2)/5. - Ehren Metcalfe, Aug 21 2017

cp's OEIS Frontend

A202453 Fibonacci self-fusion matrix, by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A080097 a(n) = Fibonacci(n+2)^2 - 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Mathematica

Maxima

PARI

Sage

Formula

Extensions

A059840 a(n) = F(n)*F(n-1) if n odd otherwise F(n)*F(n-1)-1, where F = Fibonacci numbers A000045.

Views

Author

Keywords

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A080143 a(n) = F(3)*F(n)*F(n+1) + F(4)*F(n+1)^2 - F(4) if n even, F(3)*F(n)*F(n+1) + F(4)*F(n+1)^2 if n odd, where F(n) is the n-th Fibonacci number (A000045).

Views

Author

Keywords

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

PARI

Sage

Formula

A202503 Fibonacci self-fission matrix, by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A193917 Triangular array: the self-fusion of (p(n,x)), where p(n,x)=sum{F(k+1)*x^(n-k) : 0<=k<=n}, where F=A000045 (Fibonacci numbers).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A194000 Triangular array: the self-fission of (p(n,x)), where sum{F(k+1)*x^(n-k) : 0<=k<=n}, where F=A000045 (Fibonacci numbers).

Views

Author

Keywords

Comments

A059840 a(n) = F(n)F(n-1) if n odd otherwise F(n)F(n-1)-1, where F = Fibonacci numbers A000045.

A080143 a(n) = F(3)F(n)F(n+1) + F(4)F(n+1)^2 - F(4) if n even, F(3)F(n)F(n+1) + F(4)F(n+1)^2 if n odd, where F(n) is the n-th Fibonacci number (A000045).

A214884 a(n) = Sum_{k=0..n} (-1)^kF(k)F(k+2), where F=A000045 (Fibonacci numbers).