cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-4 of 4 results.

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.

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

Views

Author

Clark Kimberling, Jun 14 2012

Keywords

Comments

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.

Examples

			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.

Links

Crossrefs

Cf. A000027.

Programs

  • Mathematica
    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 *)
  • PARI
    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
  • Python
    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

Formula

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.

A213590 Rectangular array: (row n) = b**c, where b(h) = h^2, c(h) = F(n-1+h), F = A000045 (Fibonacci numbers), n>=1, h>=1, and ** = convolution.

Original entry on oeis.org

1, 5, 1, 15, 6, 2, 36, 20, 11, 3, 76, 51, 35, 17, 5, 148, 112, 87, 55, 28, 8, 273, 224, 188, 138, 90, 45, 13, 485, 421, 372, 300, 225, 145, 73, 21, 839, 758, 694, 596, 488, 363, 235, 118, 34, 1424, 1324, 1243, 1115, 968, 788, 588, 380, 191, 55, 2384, 2263, 2163, 2001, 1809, 1564, 1276, 951, 615, 309, 89
Offset: 1

Views

Author

Clark Kimberling, Jun 19 2012

Keywords

Comments

Principal diagonal: A213504.
Antidiagonal sums: A213557.
Row 1, (1,4,9,16,...)**(1,1,2,3,5,...): A053808.
Row 2, (1,4,9,16,...)**(1,2,3,5,8,...): A213586.
Row 3, (1,4,9,16,...)**(2,3,5,8,13,...).
For a guide to related arrays, see A213500.

Examples

			Northwest corner (the array is read by falling antidiagonals):
1....5....15....36....76.....148
1....6....20....51....112....224
2....11...35....87....188....372
3....17...55....138...300....596
5....28...90....225...488....868
8....45...145...363...788....1564
13...73...235...588...1276...2532

Links

Crossrefs

Cf. A213500, A213587.

Programs

  • GAP
    F:=Fibonacci;; Flat(List([1..12],n-> List([1..n],k-> F(n+7)-F(k+6) -2*(n-k+1)*F(k+3)-(n-k+1)^2*F(k+1) ))) # G. C. Greubel, Jul 05 2019
  • Magma
    F:=Fibonacci; [[F(n+7) -F(k+6) -2*(n-k+1)*F(k+3) -(n-k+1)^2 *F(k+1): k in [1..n]]: n in [1..12]]; // G. C. Greubel, Jul 05 2019
  • Mathematica
    (* First program *)
b[n_]:= n^2; c[n_]:= Fibonacci[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}]] (* A213590 *)
r[n_]:= Table[T[n, k], {k, 40}]  (* columns of antidiagonal triangle *)
Table[T[n, n], {n, 1, 40}] (* A213504 *)
s[n_]:= Sum[T[i, n+1-i], {i, 1, n}]
Table[s[n], {n, 1, 50}] (* A213557 *)
(* Second program *)
t[n_, k_]:= Fibonacci[n+7] - Fibonacci[k+6] - 2*(n-k+1)*Fibonacci[k+3] - (n-k+1)^2*Fibonacci[k+1]; Table[t[n, k], {n, 1, 12}, {k, 1, n}]//Flatten (* G. C. Greubel, Jul 05 2019 *)
  • PARI
    f=fibonacci; t(n,k) = f(n+7) -f(k+6) -2*(n-k+1)*f(k+3) -(n-k+1)^2 *f(k+1);
for(n=1,12, for(k=1,n, print1(t(n,k), ", "))) \\ G. C. Greubel, Jul 05 2019
  • Sage
    f=fibonacci; [[f(n+7) -f(k+6) -2*(n-k+1)*f(k+3) - (n-k+1)^2* f(k+1) for k in (1..n)] for n in (1..12)] # G. C. Greubel, Jul 05 2019

Formula

Rows: T(n,k) = 4*T(n,k-1) -5*T(n,k-2) +*T(n,k-3) +2*T(n,k-4) -T(n,k-5).
Columns: T(n,k) = T(n-1,k) + T(n-2,k).
G.f. for row n: f(x)/g(x), where f(x) = F(n) + F(n+1)*x + F(n-1)*x^2 and g(x) = (1 - x - x^2)*(1 - x )^3.
T(n, k) = Fibonacci(n+k+6) - Fibonacci(n+6) - 2*k*Fibonacci(n+3) - k^2*Fibonacci(n+1). - G. C. Greubel, Jul 05 2019

A213584 Rectangular array: (row n) = b**c, where b(h) = F(h+1), c(h) = n-1+h, where F=A000045 (Fibonacci numbers), n>=1, h>=1, and ** = convolution.

Original entry on oeis.org

1, 4, 2, 10, 7, 3, 21, 16, 10, 4, 40, 32, 22, 13, 5, 72, 59, 43, 28, 16, 6, 125, 104, 78, 54, 34, 19, 7, 212, 178, 136, 97, 65, 40, 22, 8, 354, 299, 231, 168, 116, 76, 46, 25, 9, 585, 496, 386, 284, 200, 135, 87, 52, 28, 10, 960, 816, 638, 473, 337, 232, 154, 98, 58, 31, 11
Offset: 1

Views

Author

Clark Kimberling, Jun 18 2012

Keywords

Comments

Principal diagonal: A213585.
Antidiagonal sums: A213586.
Row 1, (1,2,3,5,...)**(1,2,3,4,...): A001891.
Row 2, (1,2,3,5,...)**(2,3,4,5,...): A023550.
Row 3, (1,2,3,5,...)**(3,4,5,6,...): A023554.
For a guide to related arrays, see A213500.

Examples

			Northwest corner (the array is read by falling antidiagonals):
1...4....10...21...40....72
2...7....16...32...59....104
3...10...22...43...78....136
4...13...28...54...97....168
5...16...34...65...116...200
6...19...40...76...135...232

Links

Crossrefs

Cf. A000045, A213500, A213579.

Programs

  • GAP
    Flat(List([1..12], n-> List([1..n], k-> Fibonacci(n-k+5) + k*Fibonacci(n-k+4) -(2*n+5)))) # G. C. Greubel, Jul 08 2019
  • Magma
    [[Fibonacci(n-k+5) + k*Fibonacci(n-k+4) -(2*n+5): k in [1..n]]: n in [1..12]]; // G. C. Greubel, Jul 08 2019
  • Mathematica
    (* First program *)
b[n_]:= Fibonacci[n+1]; 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}]] (* A213584 *)
r[n_]:= Table[T[n, k], {k, 40}]  (* columns of antidiagonal triangle *)
d = Table[T[n, n], {n, 1, 40}] (* A213585 *)
s[n_]:= Sum[T[i, n+1-i], {i, 1, n}]
s1 = Table[s[n], {n, 1, 50}] (* A213586 *)
(* Second program *)
Table[Fibonacci[n-k+5] + k*Fibonacci[n-k+4] -2*n-5, {n, 12}, {k, n}]//Flatten (* G. C. Greubel, Jul 08 2019 *)
  • PARI
    t(n,k) = fibonacci(n-k+5) + k*fibonacci(n-k+4) -(2*n+5);
for(n=1,12, for(k=1,n, print1(t(n,k), ", "))) \\ G. C. Greubel, Jul 08 2019
  • Sage
    [[fibonacci(n-k+5) + k*fibonacci(n-k+4) -(2*n+5) for k in (1..n)] for n in (1..12)] # G. C. Greubel, Jul 08 2019

Formula

T(n,k) = 3*T(n,k-1) - 2*T(n,k-2) - T(n,k-3) + T(n,k-4).
G.f. for row n: f(x)/g(x), where f(x) = n + x - (n - 1)*x and g(x) = (1 - x - x^2)*(1 - x)^2.
T(n, k) = Fibonacci(k+4) + n*Fibonacci(k+3) - 2*(n+k) - 3. - G. C. Greubel, Jul 08 2019

A213585 Principal diagonal of the convolution array A213584.

Original entry on oeis.org

1, 7, 22, 54, 116, 232, 443, 821, 1490, 2664, 4710, 8256, 14373, 24883, 42878, 73594, 125880, 214664, 365087, 619425, 1048666, 1771852, 2988362, 5031744, 8459401, 14201887, 23811238, 39873726, 66695420, 111440104, 186016835
Offset: 1

Views

Author

Clark Kimberling, Jun 18 2012

Keywords

Links

Crossrefs

Cf. A000045, A213500, A213584.

Programs

  • GAP
    F:=Fibonacci;; List([1..40], n-> F(n+4) +n*F(n+3) -(4*n+3)) # G. C. Greubel, Jul 08 2019
  • Magma
    F:=Fibonacci; [F(n+4) +n*F(n+3) -(4*n+3): n in [1..40]]; // G. C. Greubel, Jul 08 2019
  • Mathematica
    (* First program *)
b[n_]:= Fibonacci[n+1]; 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}]] (* A213584 *)
r[n_]:= Table[T[n, k], {k, 40}]  (* columns of antidiagonal triangle *)
d = Table[T[n, n], {n, 1, 40}] (* A213585 *)
s[n_]:= Sum[T[i, n+1-i], {i, 1, n}]
s1 = Table[s[n], {n, 1, 50}] (* A213586 *)
(* Second program *)
Table[Fibonacci[n+4] + n*Fibonacci[n+3] -4*n-3, {n, 40}] (* G. C. Greubel, Jul 08 2019 *)
  • PARI
    vector(40, n, f=fibonacci; f(n+4) +n*f(n+3) -(4*n+3)) \\ G. C. Greubel, Jul 08 2019
  • Sage
    f=fibonacci; [f(n+4) +n*f(n+3) -(4*n+3) for n in (1..40)] # G. C. Greubel, Jul 08 2019

Formula

a(n) = 4*a(n-1) - 4*a(n-2) - 2*a(n-3) + 4*a(n-4) + a(n-5).
G.f.: x*(1 + 3*x - 2*x^2 - 4*x^3 - 2*x^4)/(1 - 2*x + x^3)^2.
a(n) = Fibonacci(n+4) + n*Fibonacci(n+3) - (4*n + 3). - G. C. Greubel, Jul 08 2019
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.