A213564 -id:A213564 - 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.

A101094 a(n) = n(n+1)(n+2)(n+3)(1+3*n+n^2)/120.

Original entry on oeis.org

1, 11, 57, 203, 574, 1386, 2982, 5874, 10791, 18733, 31031, 49413, 76076, 113764, 165852, 236436, 330429, 453663, 612997, 816431, 1073226, 1394030, 1791010, 2277990, 2870595, 3586401, 4445091, 5468617, 6681368, 8110344, 9785336

Offset: 1

Cecilia Rossiter (cecilia(AT)noticingnumbers.net), Dec 15 2004

Partial sums of A024166. Third partial sums of cubes (A000578).

Antidiagonal sums of the array A213564. - Clark Kimberling, Jun 18 2012

Danny Rorabaugh, Table of n, a(n) for n = 1..10000
Feihu Liu, Guoce Xin, and Chen Zhang, Ehrhart Polynomials of Order Polytopes: Interpreting Combinatorial Sequences on the OEIS, arXiv:2412.18744 [math.CO], 2024. See p. 13.
C. Rossiter, Depictions, Explorations and Formulas of the Euler/Pascal Cube [Dead link]
C. Rossiter, Depictions, Explorations and Formulas of the Euler/Pascal Cube [Cached copy, May 15 2013]
Index entries for linear recurrences with constant coefficients, signature (7,-21,35,-35,21,-7,1).

Cf. A000537, A101097, A101102, A101104.

[n*(n+1)*(n+2)*(n+3)*(1+3*n+n^2)/120 : n in [1..35]]; // Vincenzo Librandi, Apr 23 2015

Table[n*(n + 1)*(n + 2)*(n + 3)*(1 + 3*n + n^2)/120, {n, 31}] (* Michael De Vlieger, Apr 20 2015 *)

[n*(n+1)*(n+2)*(n+3)*(1+3*n+n^2)/120 for n in range(1,32)] # Danny Rorabaugh, Apr 20 2015

This sequence could be obtained from the general formula n*(n+1)*(n+2)*(n+3)*...*(n+k)*(n*(n+k)+(k-1)*k/6)/((k+3)!/6) at k=3. - Alexander R. Povolotsky, May 17 2008
G.f.: -x*(1+4*x+x^2) / (x-1)^7. - R. J. Mathar, Dec 06 2011
Sum_{n>0} 1/a(n) = (8/3)*(25-9*sqrt(5)*Pi*tan(sqrt(5)*Pi/2)). - Enrique Pérez Herrero, Dec 02 2014
a(k) = MagicNKZ(3,k,7) where MagicNKZ(n,k,z) = Sum_{j=0..k+1} (-1)^j*binomial(n+1-z,j)*(k-j+1)^n. (Cf. A101104.) - Danny Rorabaugh, Apr 23 2015

Edited by Ralf Stephan, Dec 16 2004

A213575 Antidiagonal sums of the convolution array A213573.

Original entry on oeis.org

1, 10, 47, 158, 441, 1098, 2539, 5590, 11909, 24818, 50967, 103662, 209521, 421786, 846947, 1697990, 3400893, 6807618, 13622095, 27252190, 54513641, 109037930, 218088027, 436189878, 872395381, 1744808338, 3489636359

Offset: 1

Clark Kimberling, Jun 18 2012

Clark Kimberling, Table of n, a(n) for n = 1..500
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 (6,-14,16,-9,2).

Cf. A213564, A213500, A232603, A232604.

List([1..30], n-> 13*2^(n+1)-(n^3+6*n^2+18*n+26)); # G. C. Greubel, Jul 25 2019

[13*2^(n+1)-(n^3+6*n^2+18*n+26): n in [1..30]]; // 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, 1, 60}]  (* A213573 *)
d = Table[t[n, n], {n, 1, 40}] (* A213574 *)
s[n_]:= Sum[t[i, n+1-i], {i, 1, n}]
s1 = Table[s[n], {n, 1, 50}] (* A213575 *)
(* Additional programs *)
Table[Sum[k^3*2^(n-k),{k,0,n}],{n,1,30}] (* Vaclav Kotesovec, Nov 28 2013 *)

vector(30, n, 13*2^(n+1)-(n^3+6*n^2+18*n+26)) \\ G. C. Greubel, Jul 25 2019

[13*2^(n+1)-(n^3+6*n^2+18*n+26) for n in (1..30)] # G. C. Greubel, Jul 25 2019

a(n) = 6*a(n-1) - 14*a(n-2) + 16*a(n-3) - 9*a(n-4) + 2*a(n-5).
G.f.: x*(1 + 4 x + x^2)/((1 - 2*x)*(1 - x)^4).
From Stanislav Sykora, Nov 27 2013: (Start)
a(n) = 2^n*Sum_{k=0..n} k^p*q^k, for p=3, q=1/2.
a(n) = 2^(n+1)*13 - (n^3 + 6*n^2 + 18*n + 26). (End)
a(n) = 2*a(n-1) + n^3. - Sochima Everton, Biereagu, Jul 14 2019
E.g.f.: 26*exp(2*x) - (26 +25*x +9*x^2 +x^3)*exp(x). - G. C. Greubel, Jul 25 2019

cp's OEIS Frontend

A213565 Principal diagonal of the convolution array A213564.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

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

A101094 a(n) = n*(n+1)*(n+2)*(n+3)*(1+3*n+n^2)/120.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

Sage

Formula

Extensions

A213575 Antidiagonal sums of the convolution array A213573.

Views

Author

Keywords

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

Sage

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.

A101094 a(n) = n(n+1)(n+2)(n+3)(1+3*n+n^2)/120.