A213575 -id:A213575 - cp's OEIS frontend

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

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.

A232603 a(n) = 2^n * Sum_{k=0..n} k^p*q^k, where p=2, q=-1/2.

Original entry on oeis.org

0, -1, 2, -5, 6, -13, 10, -29, 6, -69, -38, -197, -250, -669, -1142, -2509, -4762, -9813, -19302, -38965, -77530, -155501, -310518, -621565, -1242554, -2485733, -4970790, -9942309, -19883834, -39768509, -79536118

Offset: 0

Stanislav Sykora, Nov 27 2013

The factor 2^n (i.e., |1/q|^n) is present to keep the values integer.

See also A232600 and references therein for integer values of q.

			a(3) = 2^3 * [0^2/2^0 - 1^2/2^1 + 2^2/2^2 - 3^2/2^3] = -5.

Stanislav Sykora, Table of n, a(n) for n = 0..1000
S. Sykora, Finite and Infinite Sums of the Power Series (k^p)(x^k), DOI 10.3247/SL1Math06.002, Section V.
Index entries for linear recurrences with constant coefficients, signature (-1,3,5,2).

Cf. A001045 (p=0,q=-1/2), A053088 (p=1,q=-1/2), A232604 (p=3,q=-1/2), A000225 (p=0,q=1/2), A000295 and A125128 (p=1,q=1/2), A047520 (p=2,q=1/2), A213575 (p=3,q=1/2), A232599 (p=3,q=-1), A232600 (p=1,q=-2), A232601 (p=2,q=-2), A232602 (p=3,q=-2).

[((-1)^n*(2+12*n+9*n^2) -2^(n+1))/27: n in [0..30]]; // G. C. Greubel, Mar 31 2021

A232603:= n-> ((-1)^n*(2+12*n+9*n^2) -2^(n+1))/27; seq(A232603(n), n=0..35); # G. C. Greubel, Mar 31 2021

LinearRecurrence[{-1,3,5,2}, {0,-1,2,-5}, 35] (* G. C. Greubel, Mar 31 2021 *)

a(n)=((-1)^n*(9*n^2+12*n+2)-2^(n+1))/27;

[((-1)^n*(2+12*n+9*n^2) -2^(n+1))/27 for n in (0..30)] # G. C. Greubel, Mar 31 2021

a(n) = ((-1)^n*(9*n^2+12*n+2) - 2^(n+1))/27.
G.f.: x*(-1+x)/( (1-2*x)*(1+x)^3 ). - R. J. Mathar, Nov 23 2014
E.g.f.: (1/27)*(-2*exp(2*x) + (2 -21*x +9*x^2)*exp(-x)). - G. C. Greubel, Mar 31 2021
a(n) = - a(n-1) + 3*a(n-2) + 5*a(n-3) + 2*a(n-4). - Wesley Ivan Hurt, Mar 31 2021

A232604 a(n) = 2^n * Sum_{k=0..n} k^p*q^k, where p=3, q=-1/2.

Original entry on oeis.org

0, -1, 6, -15, 34, -57, 102, -139, 234, -261, 478, -375, 978, -241, 2262, 1149, 6394, 7875, 21582, 36305, 80610, 151959, 314566, 616965, 1247754, 2479883, 4977342, 9935001, 19891954, 39759519, 79546038, 159062285

Offset: 0

Stanislav Sykora, Nov 27 2013

The factor 2^n (i.e., |1/q|^n) is present to make the values integers.
See also A232600 and references therein for integer values of q.
The same values with different signs are produced by a(n) = n^3 - 2*a(n). The signs are all positive until n = 15, with negative signs on values for all subsequent odd indices. - Richard R. Forberg, Feb 17 2014.

			a(3) = 2^3 * (0^3/2^0 - 1^3/2^1 + 2^3/2^2 - 3^3/2^3) = 0-4+16-27 = -15.

Stanislav Sykora, Table of n, a(n) for n = 0..1000
S. Sykora, Finite and Infinite Sums of the Power Series (k^p)(x^k), DOI 10.3247/SL1Math06.002, Section V.
Index entries for linear recurrences with constant coefficients, signature (-2,2,8,7,2).

Cf. A001045 (p=0,q=-1/2), A053088 (p=1,q=-1/2), A232603 (p=2,q=-1/2), A000225 (p=0,q=1/2), A000295 and A125128 (p=1,q=1/2), A047520 (p=2,q=1/2), A213575 (p=3,q=1/2), A232599 (p=3,q=-1), A232600 (p=1,q=-2), A232601 (p=2,q=-2), A232602 (p=3,q=-2).

[(2^(n+1) + (-1)^n*(9*n^3 +18*n^2 +6*n -2))/27: n in [0..35]]; // G. C. Greubel, Mar 31 2021

A232604:= n-> (2^(n+1) +(-1)^n*(9*n^3 +18*n^2 +6*n -2))/27; seq(A232604(n), n=0..30); # G. C. Greubel, Mar 31 2021

LinearRecurrence[{-2,2,8,7,2}, {0,-1,6,-15,34}, 35] (* G. C. Greubel, Mar 31 2021 *)

a(n)=(2^(n+1)+(-1)^n*(9*n^3+18*n^2+6*n-2))/27;

[(2^(n+1) + (-1)^n*(9*n^3 +18*n^2 +6*n -2))/27 for n in (0..35)] # G. C. Greubel, Mar 31 2021

a(n) = (2^(n+1) + (-1)^n*(9*n^3+18*n^2+6*n-2))/27.
G.f.: x*(1-4*x+x^2) / ( (2*x-1)*(1+x)^4 ). - R. J. Mathar, Nov 23 2014
E.g.f.: (1/27)*(2*exp(2*x) - (2 +33*x -45*x^2 +9*x^3)*exp(-x)). - G. C. Greubel, Mar 31 2021
a(n) = - 2*a(n-1) + 2*a(n-2) + 8*a(n-3) + 7*a(n-4) + 2*a(n-5). - Wesley Ivan Hurt, Mar 31 2021

A213573 Rectangular array: (row n) = bc, where b(h) = 2^(h-1), c(h) = (n-1+h)^2, n>=1, h>=1, and = convolution.

Original entry on oeis.org

1, 6, 4, 21, 17, 9, 58, 50, 34, 16, 141, 125, 93, 57, 25, 318, 286, 222, 150, 86, 36, 685, 621, 493, 349, 221, 121, 49, 1434, 1306, 1050, 762, 506, 306, 162, 64, 2949, 2693, 2181, 1605, 1093, 693, 405, 209, 81, 5998, 5486, 4462, 3310, 2286, 1486

Offset: 1

Clark Kimberling, Jun 18 2012

Principal diagonal: A213574.
Antidiagonal sums: A213575.
row 1, (1,2,4,8,...)**(1,4,9,16...): A047520.
row 2, (1,2,4,8,...)**(4,9,16,25...).
row 3, (1,2,4,8,...)**(9,16,25,36...).
For a guide to related arrays, see A213500.

			Northwest corner (the array is read by falling antidiagonals):
   1,    6,   21,   58,  141,  318, ...
   4,   17,   50,  125,  286,  621, ...
   9,   34,   93,  222,  493, 1050, ...
  16,   57,  150,  349,  762, 1605, ...
  25,   86,  221,  506, 1093, 2286, ...
  36,  121,  306,  693, 1486, 3093, ...
  ...

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

Cf. A213500.

Flat(List([1..12], n-> List([1..n], k-> 2^(n-k+1)*((k+1)^2 +2)- ((n+2)^2 +2) ))); # G. C. Greubel, Jul 25 2019

[2^(n-k+1)*((k+1)^2 +2)-((n+2)^2 +2): k in [1..n], n in [1..12]]; // G. C. Greubel, Jul 25 2019

(* First program *)
b[n_]:= 2^(n-1); c[n_]:= n^2;
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, 60}] (* A213573 *)
d = Table[T[n, n], {n, 40}] (* A213574 *)
s[n_]:= Sum[T[i, n+1-i], {i, 1, n}]
s1 = Table[s[n], {n, 1, 50}] (* A213575 *)
(* Additional programs *)
Table[2^(n-k+1)*((k+1)^2 +2)-((n+2)^2 +2), {n,12}, {k, n}]//Flatten (* G. C. Greubel, Jul 25 2019 *)

for(n=1,12, for(k=1,n, print1(2^(n-k+1)*((k+1)^2 +2)-((n+2)^2 +2), ", "))) \\ G. C. Greubel, Jul 25 2019

[[2^(n-k+1)*((k+1)^2 +2)-((n+2)^2 +2) for k in (1..n)] for n in (1..12)] # G. C. Greubel, Jul 25 2019

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

cp's OEIS Frontend

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

A232603 a(n) = 2^n * Sum_{k=0..n} k^p*q^k, where p=2, q=-1/2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

A232604 a(n) = 2^n * Sum_{k=0..n} k^p*q^k, where p=3, q=-1/2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

A213573 Rectangular array: (row n) = b**c, where b(h) = 2^(h-1), c(h) = (n-1+h)^2, n>=1, h>=1, and ** = convolution.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

Sage

Formula

A368530 a(n) = Sum_{k=1..n} k^3 * 4^(n-k).

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

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

A213573 Rectangular array: (row n) = bc, where b(h) = 2^(h-1), c(h) = (n-1+h)^2, n>=1, h>=1, and = convolution.