A067418 -id:A067418 - cp's OEIS frontend

A067988 Row sums of triangle A067330; also of triangle A067418.

1, 3, 10, 25, 60, 133, 284, 585, 1175, 2310, 4464, 8502, 15995, 29775, 54920, 100487, 182556, 329555, 591550, 1056405, 1877821, 3323868, 5860800, 10297500, 18033925, 31487643, 54824854, 95211205, 164948700, 285121105, 491804144, 846631137, 1454746355, 2495275650

Offset: 0

Wolfdieter Lang, Feb 15 2002

a(n) is the sum of the positions of the 0's in all Fibonacci binary words of length n+1. A Fibonacci binary word is a binary word having no 00 subword. Example: a(3)=25 because the Fibonacci binary words of length 4 are 1110, 1111, 1101, 1010, 1011, 0110, 0111 and 0101, the positions of the 0's being 4, 3, 2, 4, 2, 1, 4, 1, 1 and 3 (their sum is 25). - Emeric Deutsch, Jan 04 2009

Cf. A000045, A001628, A067330, A067418.

a:=n->sum(binomial(n-j,j)*n*j/2,j=0..n): seq(a(n), n=2..30); # Zerinvary Lajos, Oct 19 2006

Table[((n+2)((3n+5)Fibonacci[n+1]+(n+1)Fibonacci[n]))/10,{n,0,30}] (* Harvey P. Dale, Feb 02 2020 *)

a(n) = (n+2)*((3*n+5)*F(n+1)+(n+1)*F(n))/10, with F(n) := A000045(n) (Fibonacci).
G.f.: (1+x^2)/(1-x-x^2)^3.
Sum_{j=0..n} binomial(n-j,j)*n*j/2. - Zerinvary Lajos, Oct 19 2006
E.g.f.: exp(x/2)*(5*(10 + 18*x + 7*x^2)*cosh(sqrt(5)*x/2) + sqrt(5)*(14 + 46*x + 15*x^2)*sinh(sqrt(5)*x/2))/50. - Stefano Spezia, Aug 30 2025

a(29)-a(33) from Stefano Spezia, Aug 30 2025

A213500 Rectangular array T(n,k): (row n) = bc, where b(h) = h, c(h) = h + n - 1, n >= 1, h >= 1, and = convolution.

Original entry on oeis.org

1, 4, 2, 10, 7, 3, 20, 16, 10, 4, 35, 30, 22, 13, 5, 56, 50, 40, 28, 16, 6, 84, 77, 65, 50, 34, 19, 7, 120, 112, 98, 80, 60, 40, 22, 8, 165, 156, 140, 119, 95, 70, 46, 25, 9, 220, 210, 192, 168, 140, 110, 80, 52, 28, 10, 286, 275, 255, 228, 196, 161, 125, 90

Offset: 1

Clark Kimberling, Jun 14 2012

Principal diagonal: A002412.
Antidiagonal sums: A002415.
Row 1:  (1,2,3,...)**(1,2,3,...) = A000292.
Row 2:  (1,2,3,...)**(2,3,4,...) = A005581.
Row 3:  (1,2,3,...)**(3,4,5,...) = A006503.
Row 4:  (1,2,3,...)**(4,5,6,...) = A060488.
Row 5:  (1,2,3,...)**(5,6,7,...) = A096941.
Row 6:  (1,2,3,...)**(6,7,8,...) = A096957.
...
In general, the convolution of two infinite sequences is defined from the convolution of two n-tuples:  let X(n) = (x(1),...,x(n)) and Y(n)=(y(1),...,y(n)); then X(n)**Y(n) = x(1)*y(n)+x(2)*y(n-1)+...+x(n)*y(1); this sum is the n-th term in the convolution of infinite sequences:(x(1),...,x(n),...)**(y(1),...,y(n),...), for all n>=1.
...
In the following guide to related arrays and sequences, row n of each array T(n,k) is the convolution b**c of the sequences b(h) and c(h+n-1). The principal diagonal is given by T(n,n) and the n-th antidiagonal sum by S(n). In some cases, T(n,n) or S(n) differs in offset from the listed sequence.
b(h)........ c(h)........ T(n,k) .. T(n,n) .. S(n)
h .......... h .......... A213500 . A002412 . A002415
h .......... h^2 ........ A212891 . A213436 . A024166
h^2 ........ h .......... A213503 . A117066 . A033455
h^2 ........ h^2 ........ A213505 . A213546 . A213547
h .......... h*(h+1)/2 .. A213548 . A213549 . A051836
h*(h+1)/2 .. h .......... A213550 . A002418 . A005585
h*(h+1)/2 .. h*(h+1)/2 .. A213551 . A213552 . A051923
h .......... h^3 ........ A213553 . A213554 . A101089
h^3 ........ h .......... A213555 . A213556 . A213547
h^3 ........ h^3 ........ A213558 . A213559 . A213560
h^2 ........ h*(h+1)/2 .. A213561 . A213562 . A213563
h*(h+1)/2 .. h^2 ........ A213564 . A213565 . A101094
2^(h-1) .... h .......... A213568 . A213569 . A047520
2^(h-1) .... h^2 ........ A213573 . A213574 . A213575
h .......... Fibo(h) .... A213576 . A213577 . A213578
Fibo(h) .... h .......... A213579 . A213580 . A053808
Fibo(h) .... Fibo(h) .... A067418 . A027991 . A067988
Fibo(h+1) .. h .......... A213584 . A213585 . A213586
Fibo(n+1) .. Fibo(h+1) .. A213587 . A213588 . A213589
h^2 ........ Fibo(h) .... A213590 . A213504 . A213557
Fibo(h) .... h^2 ........ A213566 . A213567 . A213570
h .......... -1+2^h ..... A213571 . A213572 . A213581
-1+2^h ..... h .......... A213582 . A213583 . A156928
-1+2^h ..... -1+2^h ..... A213747 . A213748 . A213749
h .......... 2*h-1 ...... A213750 . A007585 . A002417
2*h-1 ...... h .......... A213751 . A051662 . A006325
2*h-1 ...... 2*h-1 ...... A213752 . A100157 . A071238
2*h-1 ...... -1+2^h ..... A213753 . A213754 . A213755
-1+2^h ..... 2*h-1 ...... A213756 . A213757 . A213758
2^(n-1) .... 2*h-1 ...... A213762 . A213763 . A213764
2*h-1 ...... Fibo(h) .... A213765 . A213766 . A213767
Fibo(h) .... 2*h-1 ...... A213768 . A213769 . A213770
Fibo(h+1) .. 2*h-1 ...... A213774 . A213775 . A213776
Fibo(h) .... Fibo(h+1) .. A213777 . A001870 . A152881
h .......... 1+[h/2] .... A213778 . A213779 . A213780
1+[h/2] .... h .......... A213781 . A213782 . A005712
1+[h/2] .... [(h+1)/2] .. A213783 . A213759 . A213760
h .......... 3*h-2 ...... A213761 . A172073 . A002419
3*h-2 ...... h .......... A213771 . A213772 . A132117
3*h-2 ...... 3*h-2 ...... A213773 . A214092 . A213818
h .......... 3*h-1 ...... A213819 . A213820 . A153978
3*h-1 ...... h .......... A213821 . A033431 . A176060
3*h-1 ...... 3*h-1 ...... A213822 . A213823 . A213824
3*h-1 ...... 3*h-2 ...... A213825 . A213826 . A213827
3*h-2 ...... 3*h-1 ...... A213828 . A213829 . A213830
2*h-1 ...... 3*h-2 ...... A213831 . A213832 . A212560
3*h-2 ...... 2*h-1 ...... A213833 . A130748 . A213834
h .......... 4*h-3 ...... A213835 . A172078 . A051797
4*h-3 ...... h .......... A213836 . A213837 . A071238
4*h-3 ...... 2*h-1 ...... A213838 . A213839 . A213840
2*h-1 ...... 4*h-3 ...... A213841 . A213842 . A213843
2*h-1 ...... 4*h-1 ...... A213844 . A213845 . A213846
4*h-1 ...... 2*h-1 ...... A213847 . A213848 . A180324
[(h+1)/2] .. [(h+1)/2] .. A213849 . A049778 . A213850
h .......... C(2*h-2,h-1) A213853
...
Suppose that u = (u(n)) and v = (v(n)) are sequences having generating functions U(x) and V(x), respectively. Then the convolution u**v has generating function U(x)*V(x). Accordingly, if u and v are homogeneous linear recurrence sequences, then every row of the convolution array T satisfies the same homogeneous linear recurrence equation, which can be easily obtained from the denominator of U(x)*V(x). Also, every column of T has the same homogeneous linear recurrence as v.

			Northwest corner (the array is read by southwest falling antidiagonals):
  1,  4, 10, 20,  35,  56,  84, ...
  2,  7, 16, 30,  50,  77, 112, ...
  3, 10, 22, 40,  65,  98, 140, ...
  4, 13, 28, 50,  80, 119, 168, ...
  5, 16, 34, 60,  95, 140, 196, ...
  6, 19, 40, 70, 110, 161, 224, ...
T(6,1) = (1)**(6) = 6;
T(6,2) = (1,2)**(6,7) = 1*7+2*6 = 19;
T(6,3) = (1,2,3)**(6,7,8) = 1*8+2*7+3*6 = 40.

Clark Kimberling, Antidiagonals n = 1..60, flattened

Cf. A000027.

b[n_] := n; c[n_] := n
t[n_, k_] := Sum[b[k - i] c[n + i], {i, 0, k - 1}]
TableForm[Table[t[n, k], {n, 1, 10}, {k, 1, 10}]]
Flatten[Table[t[n - k + 1, k], {n, 12}, {k, n, 1, -1}]]
r[n_] := Table[t[n, k], {k, 1, 60}]  (* A213500 *)

t(n,k) = sum(i=0, k - 1, (k - i) * (n + i));
tabl(nn) = {for(n=1, nn, for(k=1, n, print1(t(k,n - k + 1),", ");); print(););};
tabl(12) \\ Indranil Ghosh, Mar 26 2017

def t(n, k): return sum((k - i) * (n + i) for i in range(k))
for n in range(1, 13):
    print([t(k, n - k + 1) for k in range(1, n + 1)]) # Indranil Ghosh, Mar 26 2017

T(n,k) = 4*T(n,k-1) - 6*T(n,k-2) + 4*T(n,k-3) - T(n,k-4).
T(n,k) = 2*T(n-1,k) - T(n-2,k).
G.f. for row n:  x*(n - (n - 1)*x)/(1 - x)^4.

A067331 Convolution of Fibonacci F(n+1), n >= 0, with F(n+3), n >= 0.

Original entry on oeis.org

2, 5, 12, 25, 50, 96, 180, 331, 600, 1075, 1908, 3360, 5878, 10225, 17700, 30509, 52390, 89664, 153000, 260375, 442032, 748775, 1265832, 2136000, 3598250, 6052061, 10164540, 17048641, 28559450, 47786400, 79870428, 133359715, 222457608, 370747675, 617363100

Offset: 0

Wolfdieter Lang, Feb 15 2002

Third diagonal of A067330. Third column of A067418.
From Emeric Deutsch, Jun 15 2010: (Start)
a(n) is the external path length of the Fibonacci tree of order n+3. A Fibonacci tree of order n (n >= 2) is a complete binary tree whose left subtree is the Fibonacci tree of order n-1 and whose right subtree is the Fibonacci tree of order n-2; each of the Fibonacci trees of order 0 and 1 is defined as a single node. The external path length of a tree is the sum of the levels of its external nodes (i.e., leaves).
a(n) = Sum_{k>=0} k*A178524(n+2,k).
(End)
a(n) equals the penultimate immanant of the (n+3) X (n+3) tridiagonal matrix with ones along the main diagonal, the superdiagonal, and the subdiagonal. - John M. Campbell, Jan 01 2016
a(n) is the sum of the eccentricities of the vertices of the Fibonacci cube G(n+1). Example: a(1)=5; indeed, the Fibonacci cube G(2) is the path graph P(3), the vertices of which have eccentricities 2, 1, 2. - Emeric Deutsch, May 28 2017

			From _John M. Campbell_, Jan 03 2016: (Start)
Letting n=2, the external path length of the Fibonacci tree T(5) of order n+3=5 illustrated below is 12 = a(2) = F(1)*F(5) + F(2)*F(4) + F(3)*F(3).
     .
    / \
   /\ /\
  /\
(End)

D. E. Knuth, The Art of Computer Programming, Vol. 3, 2nd edition, Addison-Wesley, Reading, MA, 1998, p. 417.

Robert Israel, Table of n, a(n) for n = 0..4720
Matthew Blair, Rigoberto Flórez, Antara Mukherjee, and José L. Ramírez, Matrices in the determinant Hosoya triangle, Fibonacci Quart. 58 (2020), no. 5, 34-54.
Matthew Blair, Rigoberto Flórez, and Antara Mukherjee, Geometric Patterns in The Determinant Hosoya Triangle, INTEGERS, A90, 2021.
J. Bodeen, S. Butler, T. Kim, X. Sun, and S. Wang, Tiling a strip with triangles, Electron. J. Combin. 21 (1) (2014), P1.7.
John M. Campbell, On the external path length of a Fibonacci tree.
Y. Horibe, An entropy view of Fibonacci trees, Fibonacci Quarterly, 20(2) (1982), 168-178.
S. Klavzar and M. Mollard, Asymptotic properties of Fibonacci cubes and Lucas cubes, HAL Id: hal-00836788, 2013.
S. Klavzar and M. Mollard, Asymptotic properties of Fibonacci cubes and Lucas cubes, Ann. Comb. 18 (2014), 447-457.
Index entries for linear recurrences with constant coefficients, signature (2,1,-2,-1).

Row sums of A108038.

Cf. A000045, A004070, A067330, A067418, A178523, A178524.

[((7*n+10)*Fibonacci(n+1)+4*(n+1)*Fibonacci(n))/5: n in [0..40]]; // Vincenzo Librandi, Jan 02 2016

f:= gfun:-rectoproc({a(n) = 2*a(n-1)+a(n-2) - 2*a(n-3)-a(n-4),a(0)=2,a(1)=5,a(2)=12,a(3)=25},a(n),remember):
map(f, [$0..50]); # Robert Israel, Jan 06 2016

LinearRecurrence[{2, 1, -2, -1}, {2, 5, 12, 25}, 70] (* Vincenzo Librandi, Jan 02 2016 *)
Table[SeriesCoefficient[(2 + x)/(1 - x - x^2)^2, {x, 0, n}], {n, 0, 34}] (* Michael De Vlieger, Jan 02 2016 *)
Print[Table[Sum[Binomial[n + 3 - i, i]*(n + 2 - 2*i), {i, 0, Floor[(n + 3)/2]}], {n, 0, 100}]] (* John M. Campbell, Jan 04 2016 *)
Module[{nn=40,fibs},fibs=Fibonacci[Range[nn]];Table[ListConvolve[Take[ fibs,n],Take[fibs,{2,n+2}]],{n,nn-2}]][[All,2]] (* Harvey P. Dale, Aug 03 2019 *)

Vec((2+x)/(1-x-x^2)^2 + O(x^100)) \\ Altug Alkan, Jan 04 2016

a(n) = A067330(n+2, n) = A067418(n+2, 2) = Sum_{k=0..n} F(k+1)*F(n+3-k), n >= 0.
a(n) = ((7*n + 10)*F(n + 1) + 4*(n + 1)*F(n))/5, with F(n) = A000045(n) (Fibonacci).
G.f.: (2 + x)/(1 - x - x^2)^2.
a(n) = Sum_{i=0..floor((n+3)/2)} binomial(n+3-i, i)*(n + 2 - 2*i). - John M. Campbell, Jan 04 2016
E.g.f.: exp(x/2)*((50 + 55*x)*cosh(sqrt(5)*x/2) + sqrt(5)*(18 + 25*x)*sinh(sqrt(5)*x/2))/25. - Stefano Spezia, Dec 04 2023

A067330 Triangle read by rows of incomplete convolutions of Fibonacci numbers F(n+1) = A000045(n+1), n>=0.

Original entry on oeis.org

1, 1, 2, 2, 3, 5, 3, 5, 7, 10, 5, 8, 12, 15, 20, 8, 13, 19, 25, 30, 38, 13, 21, 31, 40, 50, 58, 71, 21, 34, 50, 65, 80, 96, 109, 130, 34, 55, 81, 105, 130, 154, 180, 201, 235, 55, 89, 131, 170, 210, 250, 289, 331, 365, 420, 89, 144, 212, 275, 340, 404, 469, 532, 600, 655, 744, 144, 233, 343, 445

Offset: 0

Wolfdieter Lang, Feb 15 2002

The diagonals d>=0 (d=0: main diagonal) give convolutions of Fibonacci numbers F(n+1), n>=0, with those with d-shifted index: a(d+n,d)=sum(F(k+1)*F(d+n+1-k),k=0..n), n>=0.
The row polynomials p(n,x) := sum(a(n,m)*x^m,m=0..n) are generated by A(x*z)*(A(z)-x*A(x*z))/(1-x), with A(x) := 1/(1-x-x^2) (g.f. Fibonacci F(n+1), n>=0).
The diagonals give A001629(n+2), A023610, A067331-4, A067430-1, A067977-8 for d= n-m= 0..9, respectively.
A row with n terms = the dot product of vectors with n terms: (1,1,2,3,...)dot(...3,2,1,1) with carryovers; such that (3, 5, 7, 10) = (1*3=3), (1*2+3=5), (2*1+5=7), (3*1+7=10).

			{1}; {1,2}; {2,3,5}; {3,5,7,10}; ...; p(2,n)= 2+3*x+5*x^2.

Michael De Vlieger, Table of n, a(n) for n = 0..10000

Cf. A067418 (triangle with rows read backwards).

Table[Sum[Fibonacci[k + 1] Fibonacci[n - k + 1], {k, 0, m}], {n, 0, 11}, {m, 0, n}] // Flatten (* Michael De Vlieger, Apr 11 2016 *)

a(n, m)= sum(F(k+1)*F(n-k+1), k=0..m), n>=m>=0, else 0.
a(n, m)= (((3*m+5)*F(m+1)+(m+1)*F(m))*F(n-m+1)+(m*F(m+1)+2*(m+1)*F(m))*F(n-m))/5.
G.f. for diagonals d=n-m>=0: (x^d)*(F(d+1)+F(d)*x)/(1-x-x^2)^2, with F(n) := A000045(n) (Fibonacci).
a(n, m) = ((-1)^m*F(n-2*m-1)+m*L(n+2)+5*F(n)+4*F(n-1))/5, with F(-n) = (-1)^(n+1)*F(n), hence a(n, m) = (2*(m+1)*L(n+2)-A067979(n, m))/5, n>=m>=0. - Ehren Metcalfe, Apr 11 2016

A067990 Triangle A067979 with rows read backwards.

Original entry on oeis.org

1, 6, 3, 17, 13, 4, 38, 31, 19, 7, 80, 69, 48, 32, 11, 158, 140, 107, 79, 51, 18, 303, 274, 220, 176, 127, 83, 29, 566, 519, 432, 360, 283, 206, 134, 47, 1039, 963, 822, 706, 580, 459, 333, 217, 76, 1880, 1757, 1529, 1341, 1138, 940, 742, 539, 351, 123, 3364, 3165, 2796, 2492, 2163, 1844, 1520, 1201

Offset: 0

Wolfdieter Lang, Feb 15 2002

The column m (without leading 0's) gives the convolution of Lucas numbers {L(n+1) := A000204(n+1)}, n>=0, with those with m-shifted index: a(n+m,m)=sum(L(k+1)*L(m+n+1-k),k=0..n), n>=0,m=0,1,...
The columns give A004799(n-1), A067980-7 for m= 0..8, respectively. Row sums give A067989.
The row polynomials p(n,x) := sum(a(n,m)*x^m,m=0..n) are generated by A(z)*(A(z)-x*A(x*z))/(1-x), with A(x) := (1+2*x)/(1-x-x^2) (g.f. for Lucas {L(n+1)}).

			{1}; {6,3}; {17,13,4}; {38,31,19,7}; ...; p(2,x)=17+13*x+4*x^2.

Michael De Vlieger, Table of n, a(n) for n = 0..10000

Reverse /@ Table[Sum[LucasL[k + 1] LucasL[n - k + 1], {k, 0, m}], {n, 0, 11}, {m, 0, n}] // Flatten (* Michael De Vlieger, Apr 11 2016 *)

a(n, m)=A067330(n, n-m), n>=m>=0, else 0.
a(n, m)=(n-m+1)*L(m+1)*F(n-m)+((n-m+1)*L(m+1)+(n-m)*L(m))*F(n-m+1), n>=m>=0, else 0; with F(n) := A000045(n)(Fibonacci) and L(n) := A000032(n) (Lucas).
G.f. for column m=0, 1, ...: (x^m)*(L(m+1)+L(m)*x)*(1+2*x)/(1-x-x^2)^2.
a(n, m) = -(-1)^m*F(n-2*m+1)-m*L(n+2)+n*L(n+2)+F(n+3), with F(-n) = (-1)^(n+1)*F(n), hence a(n, m) = -5*A067418(n, m)+2*(n-m+1)*L(n+2), n>=m>=0. - Ehren Metcalfe, Apr 11 2016

A067430 Convolution of Fibonacci F(n+1), n>=0, with F(n+7), n>=0.

Original entry on oeis.org

13, 34, 81, 170, 340, 654, 1227, 2258, 4095, 7340, 13032, 22956, 40169, 69890, 121005, 208606, 358268, 613242, 1046535, 1781170, 3024123, 5123104, 8661456, 14616600, 24624325, 41419234, 69568137, 116690258

Offset: 0

Wolfdieter Lang, Feb 15 2002

Seventh diagonal of A067330. Seventh column of A067418.

a(n)= A067330(n+6, n) = A067418(n+6, 6)= sum(F(k+1)*F(n+7-k), k=0..n), n>=0.
a(n)= ((47*n+65)*F(n+1)+29*(n+1)*F(n))/5, F(n) := A000045(n) (Fibonacci).
G.f.: (13+8*x)/(1-x-x^2)^2.

A067977 Convolution of Fibonacci F(n+1), n>=0, with F(n+9), n>=0.

Original entry on oeis.org

34, 89, 212, 445, 890, 1712, 3212, 5911, 10720, 19215, 34116, 60096, 105158, 182965, 316780, 546113, 937918, 1605424, 2739760, 4662995, 7916984, 13412019, 22675272, 38265600, 64465450, 108433937

Offset: 0

Wolfdieter Lang, Feb 15 2002

Ninth diagonal of A067330. Ninth column of A067418.

Index entries for linear recurrences with constant coefficients, signature (2,1,-2,-1).

Cf. A000045, A000204, A067330, A067418.

CoefficientList[Series[(34 + 21*x)/(1 - x - x^2)^2, {x, 0, 30}], x] (* Wesley Ivan Hurt, Feb 16 2017 *)
LinearRecurrence[{2,1,-2,-1},{34,89,212,445},30] (* Harvey P. Dale, Dec 22 2022 *)

a(n) = A067330(n+8, n) = A067418(n+8, 8) = Sum_{k=0..n} F(k+1)*F(n+9-k), n>=0.
G.f.: (34+21*x)/(1-x-x^2)^2.
a(n) = ((123*n+5*34)*F(n+1)+76*(n+1)*F(n))/5, F(n) := A000045(n) (Fibonacci); 34=F(9), 76=L(9), 123=L(10), L(n) := A000204(n) (Lucas).

A067332 Convolution of Fibonacci F(n+1), n>=0, with F(n+4), n>=0.

Original entry on oeis.org

3, 8, 19, 40, 80, 154, 289, 532, 965, 1730, 3072, 5412, 9471, 16480, 28535, 49196, 84496, 144638, 246845, 420140, 713353, 1208518, 2043264, 3448200, 5809275, 9771704, 16413019, 27530992, 46122320

Offset: 0

Wolfdieter Lang, Feb 15 2002

Fourth diagonal of A067330. Fourth column of A067418.

Index entries for linear recurrences with constant coefficients, signature (2, 1, -2, -1).

Table[((11n+15)Fibonacci[n+1]+7(n+1)Fibonacci[n])/5,{n,0,30}] (* or *) LinearRecurrence[{2,1,-2,-1},{3,8,19,40},30] (* Harvey P. Dale, Aug 25 2014 *)

a(n)= A067330(n+3, n) = A067418(n+3, 3) = sum(F(k+1)*F(n+4-k), k=0..n), n>=0.
a(n)= ((11*n+15)*F(n+1)+7*(n+1)*F(n))/5, with F(n) := A000045(n) (Fibonacci).
G.f.: (3+2*x)/(1-x-x^2)^2.
a(0)=3, a(1)=8, a(2)=19, a(3)=40, a(n)=2*a(n-1)+a(n-2)-2*a(n-3)-a(n-4). - Harvey P. Dale, Aug 25 2014

A067333 Convolution of Fibonacci F(n+1), n>=0, with F(n+5), n>=0.

Original entry on oeis.org

5, 13, 31, 65, 130, 250, 469, 863, 1565, 2805, 4980, 8772, 15349, 26705, 46235, 79705, 136886, 234302, 399845, 680515, 1155385, 1957293, 3309096, 5584200, 9407525, 15823765, 26577559, 44579633, 74681770

Offset: 0

Wolfdieter Lang, Feb 15 2002

Fifth diagonal of A067330. Fifth column of A067418.

a(n)= A067330(n+4, n) = A067418(n+4, 4) = sum(F(k+1)*F(n+5-k), k=0..n), n>=0.
a(n)= ((18*n+25)*F(n+1)+11*(n+1)*F(n))/5, with F(n) := A000045(n) (Fibonacci).
G.f.: (5+3*x)/(1-x-x^2)^2.

A067334 Convolution of Fibonacci F(n+1), n>=0, with F(n+6), n>=0.

Original entry on oeis.org

8, 21, 50, 105, 210, 404, 758, 1395, 2530, 4535, 8052, 14184, 24820, 43185, 74770, 128901, 221382, 378940, 646690, 1100655, 1868738, 3165811, 5352360, 9032400, 15216800, 25595469, 42990578, 72110625, 120804090, 202142180, 337876622, 564176619, 941141410

Offset: 0

Wolfdieter Lang, Feb 15 2002

Sixth diagonal of A067330. Sixth column of A067418.

Index entries for linear recurrences with constant coefficients, signature (2,1,-2,-1).

Cf. A067330, A067418.

CoefficientList[Series[(8+5x)/(1-x-x^2)^2,{x,0,40}],x] (* or *) LinearRecurrence[{2,1,-2,-1},{8,21,50,105},40] (* Harvey P. Dale, Apr 07 2012 *)

a(n) = A067330(n+5, n) = A067418(n+5, 5) = Sum_{k=0..n} F(k+1)*F(n+6-k), n>=0.
a(n) = ((29*n+40)*F(n+1)+18*(n+1)*F(n))/5, with F(n) := A000045(n) (Fibonacci).
G.f.: (8+5*x)/(1-x-x^2)^2.
a(0)=8, a(1)=21, a(2)=50, a(3)=105, a(n) = 2*a(n-1)+a(n-2)-2*a(n-3)-a(n-4). - Harvey P. Dale, Apr 07 2012

More terms from Jason Yuen, Aug 27 2025

cp's OEIS Frontend

A067988 Row sums of triangle A067330; also of triangle A067418.

Views

Author

Keywords

Comments

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A213500 Rectangular array T(n,k): (row n) = b**c, where b(h) = h, c(h) = h + n - 1, n >= 1, h >= 1, and ** = convolution.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A067331 Convolution of Fibonacci F(n+1), n >= 0, with F(n+3), n >= 0.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A067330 Triangle read by rows of incomplete convolutions of Fibonacci numbers F(n+1) = A000045(n+1), n>=0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A067990 Triangle A067979 with rows read backwards.

Views

Author

Keywords

Comments

Examples

Links

Programs

Mathematica

Formula

A067430 Convolution of Fibonacci F(n+1), n>=0, with F(n+7), n>=0.

Views

Author

Keywords

Crossrefs

Formula

A067977 Convolution of Fibonacci F(n+1), n>=0, with F(n+9), n>=0.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A067332 Convolution of Fibonacci F(n+1), n>=0, with F(n+4), n>=0.

Views

Author

A213500 Rectangular array T(n,k): (row n) = bc, where b(h) = h, c(h) = h + n - 1, n >= 1, h >= 1, and = convolution.