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

A237616 a(n) = n(n + 1)(5*n - 4)/2.

Original entry on oeis.org

0, 1, 18, 66, 160, 315, 546, 868, 1296, 1845, 2530, 3366, 4368, 5551, 6930, 8520, 10336, 12393, 14706, 17290, 20160, 23331, 26818, 30636, 34800, 39325, 44226, 49518, 55216, 61335, 67890, 74896, 82368, 90321, 98770, 107730, 117216, 127243, 137826, 148980, 160720

Offset: 0

Bruno Berselli, Feb 10 2014

Also 17-gonal (or heptadecagonal) pyramidal numbers.

This sequence is related to A226489 by 2*a(n) = n*A226489(n) - Sum_{i=0..n-1} A226489(i).

			After 0, the sequence is provided by the row sums of the triangle:
   1;
   2,  16;
   3,  32,  31;
   4,  48,  62,  46;
   5,  64,  93,  92,  61;
   6,  80, 124, 138, 122,  76;
   7,  96, 155, 184, 183, 152,  91;
   8, 112, 186, 230, 244, 228, 182, 106;
   9, 128, 217, 276, 305, 304, 273, 212, 121;
  10, 144, 248, 322, 366, 380, 364, 318, 242, 136; etc.,
where (r = row index, c = column index):
T(r,r) = T(c,c) = 15*r-14 and T(r,c) = T(r-1,c)+T(r,r) = (r-c+1)*T(r,r), with r>=c>0.

E. Deza and M. M. Deza, Figurate numbers, World Scientific Publishing (2012), page 93 (fifteenth row of the table).

Bruno Berselli, Table of n, a(n) for n = 0..1000
Eric Weisstein's World of Mathematics, Pyramidal Number.
Index to sequences related to pyramidal numbers.
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).

Cf. A051869, A104728.

Cf. sequences with formula n*(n+1)*(k*n-k+3)/6: A000217 (k=0), A000292 (k=1), A000330 (k=2), A002411 (k=3), A002412 (k=4), A002413 (k=5), A002414 (k=6), A007584 (k=7), A007585 (k=8), A007586 (k=9), A007587 (k=10), A050441 (k=11), A172073 (k=12), A177890 (k=13), A172076 (k=14), this sequence (k=15), A172078(k=16), A237617 (k=17), A172082 (k=18), A237618 (k=19), A172117(k=20), A256718 (k=21), A256716 (k=22), A256645 (k=23), A256646(k=24), A256647 (k=25), A256648 (k=26), A256649 (k=27), A256650(k=28).

List([0..40], n-> n*(n+1)*(5*n-4)/2); # G. C. Greubel, Aug 30 2019

Magma
```
[n*(n+1)*(5*n-4)/2: n in [0..40]];
```

I:=[0,1,18,66]; [n le 4 select I[n] else 4*Self(n-1)-6*Self(n-2)+4*Self(n-3)-Self(n-4): n in [1..50]]; // Vincenzo Librandi, Feb 12 2014

seq(n*(n+1)*(5*n-4)/2, n=0..40); # G. C. Greubel, Aug 30 2019

Table[n(n+1)(5n-4)/2, {n, 0, 40}]
CoefficientList[Series[x (1+14x)/(1-x)^4, {x, 0, 40}], x] (* Vincenzo Librandi, Feb 12 2014 *)
LinearRecurrence[{4,-6,4,-1},{0,1,18,66},50] (* Harvey P. Dale, Jan 11 2015 *)

a(n)=n*(n+1)*(5*n-4)/2 \\ Charles R Greathouse IV, Sep 24 2015

[n*(n+1)*(5*n-4)/2 for n in (0..40)] # G. C. Greubel, Aug 30 2019

G.f.: x*(1 + 14*x)/(1 - x)^4.
For n>0, a(n) = Sum_{i=0..n-1} (n-i)*(15*i+1). More generally, the sequence with the closed form n*(n+1)*(k*n-k+3)/6 is also given by Sum_{i=0..n-1} (n-i)*(k*i+1) for n>0.
a(n) = A104728(A001844(n-1)) for n>0.
Sum_{n>=1} 1/a(n) = (2*sqrt(5*(5 + 2*sqrt(5)))*Pi + 10*sqrt(5)*arccoth(sqrt(5)) + 25*log(5) - 16)/72 = 1.086617842136293176... . - Vaclav Kotesovec, Dec 07 2016
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n >= 4. - Wesley Ivan Hurt, Dec 18 2020
E.g.f.: exp(x)*x*(2 + 16*x + 5*x^2)/2. - Elmo R. Oliveira, Aug 04 2025

A152767 3 times 10-gonal (or decagonal) numbers: a(n) = 3n(4*n-3).

Original entry on oeis.org

0, 3, 30, 81, 156, 255, 378, 525, 696, 891, 1110, 1353, 1620, 1911, 2226, 2565, 2928, 3315, 3726, 4161, 4620, 5103, 5610, 6141, 6696, 7275, 7878, 8505, 9156, 9831, 10530, 11253, 12000, 12771, 13566, 14385, 15228, 16095, 16986, 17901, 18840, 19803, 20790, 21801

Offset: 0

Omar E. Pol, Dec 15 2008

3*A172078(n) = n*a(n) - Sum_{k=0..n-1} a(k). - Bruno Berselli, Dec 12 2010

			For n=8, a(8) = (1*3 + 5*7 + 9*11 +..+ 29*31) - (2*4 + 6*8 + 10*12 +..+ 26*28) = 696 (see Problem 1052 in References). - _Bruno Berselli_, Dec 12 2010

"Supplemento al Periodico di Matematica", Raffaello Giusti Editore (Livorno), Jan. 1910 p. 47 (Problem 1052).

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

Cf. A001107, A001539, A002939, A139271, A153794, A172078.
3 times n-gonal numbers: A045943, A033428, A062741, A094159, A152773, A152751, A152759, A153783, A153448, A153875.
Cf. numbers of the form n*(n*k - k + 6)/2, this sequence is the case k=24: see Comments lines of A226492.

Table[3n(4n-3),{n,0,40}] (* Harvey P. Dale, May 26 2012 *)

a(n)=3*n*(4*n-3) \\ Charles R Greathouse IV, Sep 28 2015

a(n) = 12*n^2 - 9*n = 3*A001107(n).
a(n) = a(n-1) + 24*n - 21, n > 0. - Vincenzo Librandi, Nov 26 2010
a(n) = Sum_{k=0..n-1} A001539(k) - Sum_{k=0..n-1} 4*A002939(k) if n > 0 (see References, Problem 1052). - Bruno Berselli, Dec 08 2010 - Jan 21 2011
G.f.: -3*x*(1+7*x)/(x-1)^3.
a(0)=0, a(1)=3, a(2)=30, a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Harvey P. Dale, May 26 2012
From Elmo R. Oliveira, Dec 15 2024: (Start)
E.g.f.: 3*exp(x)*x*(1 + 4*x).
a(n) = A153794(n) - n. (End)

A213835 Rectangular array: (row n) = b**c, where b(h) = h, c(h) = 4n-7+4h, n>=1, h>=1, and ** = convolution.

Original entry on oeis.org

1, 7, 5, 22, 19, 9, 50, 46, 31, 13, 95, 90, 70, 43, 17, 161, 155, 130, 94, 55, 21, 252, 245, 215, 170, 118, 67, 25, 372, 364, 329, 275, 210, 142, 79, 29, 525, 516, 476, 413, 335, 250, 166, 91, 33, 715, 705, 660, 588, 497, 395

Offset: 1

Clark Kimberling, Jul 04 2012

Principal diagonal: A172078.
Antidiagonal sums: A051797.
Row 1, (1,2,3,4,5,...)**(1,5,9,13,...): A002412.
Row 2, (1,2,3,4,5,...)**(5,9,13,17,...): (4*k^3 + 15*k^2 - 11*k)/6.
Row 3, (1,2,3,4,5,...)**(9,13,17,21,...): (4*k^3 + 27*k^2 - 23*k)/6
For a guide to related arrays, see A212500.

			Northwest corner (the array is read by falling antidiagonals):
1....7....22....50....95
5....19...46....90....155
9....31...70....130...215
13...43...94....170...275
17...55...118...210...335
21...67...142...250...395

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

Cf. A212500.

Cf. A304659 (first lower diagonal).

b[n_]:=n;c[n_]:=4n-3;
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}] (* A213835 *)
Table[t[n,n],{n,1,40}] (* A172078 *)
s[n_]:=Sum[t[i,n+1-i],{i,1,n}]
Table[s[n],{n,1,50}] (* A051797 *)

T(n,k) = 4*T(n,k-1)-6*T(n,k-2)+4*T(n,k-3)-T(n,k-4).

G.f. for row n: f(x)/g(x), where f(x) = x*((4*n-3) + (4*n-7)*x) and g(x) = (1-x)^4.

A264851 a(n) = n(n + 1)(n + 2)(4n - 3)/6.

Original entry on oeis.org

0, 1, 20, 90, 260, 595, 1176, 2100, 3480, 5445, 8140, 11726, 16380, 22295, 29680, 38760, 49776, 62985, 78660, 97090, 118580, 143451, 172040, 204700, 241800, 283725, 330876, 383670, 442540, 507935, 580320, 660176, 748000, 844305, 949620, 1064490, 1189476

Offset: 0

Ilya Gutkovskiy, Nov 26 2015

Partial sums of 18-gonal (or octadecagonal) pyramidal numbers. Therefore, this is the case k=8 of the general formula n*(n + 1)*(n + 2)*(k*n - k + 2)/12, which is related to 2*(k+1)-gonal pyramidal numbers.

OEIS Wiki, Figurate numbers
Eric Weisstein's World of Mathematics, Pyramidal Number
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

Cf. A172078.

Cf. similar sequences with formula n*(n+1)*(n+2)*(k*n-k+2)/12 listed in A264850.

[n*(n + 1)*(n + 2)*(4*n - 3)/6: n in [0..50]]; // Vincenzo Librandi, Nov 27 2015

Table[n (n + 1) (n + 2) (4 n - 3)/6, {n, 0, 50}]

a(n)=n*(n+1)*(n+2)*(4*n-3)/6 \\ Charles R Greathouse IV, Jul 26 2016

G.f.: x*(1 + 15*x)/(1 - x)^5.
a(n) = Sum_{k = 0..n} A172078(k).
a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5). - Vincenzo Librandi, Nov 27 2015

A172080 a(n) = n(12n^3 + 10n^2 - 9n - 7)/6.

Original entry on oeis.org

0, 1, 37, 190, 590, 1415, 2891, 5292, 8940, 14205, 21505, 31306, 44122, 60515, 81095, 106520, 137496, 174777, 219165, 271510, 332710, 403711, 485507, 579140, 685700, 806325, 942201, 1094562, 1264690, 1453915, 1663615, 1895216, 2150192

Offset: 0

Vincenzo Librandi, Jan 25 2010

The sequence is related to A172078 by a(n) = n*A172078(n) - Sum_{i=0..n-1} A172078(i).

This is the case d=8 in the identity n^2*(n+1)*(2*d*n-2*d+3)/6 - Sum_{k=0..n-1} k*(k+1)*(2*d*k - 2*d + 3)/6 = n*(n+1)*(3*d*n^2 - d*n + 4*n - 2*d + 2)/12. - Bruno Berselli, May 07 2010, Feb 26 2011

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
B. Berselli, A description of the recursive method in Comments lines: website Matem@ticamente (in Italian).
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

Cf. A172078.

List([0..40], n-> n*(n+1)*(12*n^2 -2*n -7)/6); G. C. Greubel, Aug 30 2019

[(12*n^4+10*n^3-9*n^2-7*n)/6: n in [0..50]]; // Vincenzo Librandi, Jan 01 2014

seq(n*(n+1)*(12*n^2 -2*n -7)/6, n=0..40); # G. C. Greubel, Aug 30 2019

CoefficientList[Series[x(1+32x+15x^2)/(1-x)^5, {x, 0, 40}], x] (* Vincenzo Librandi, Jan 01 2014 *)
Table[n*(n+1)*(12*n^2 -2*n -7)/6, {n,0,40}] (* G. C. Greubel, Aug 30 2019 *)

vector(40, n, n*(n-1)*(12*(n-1)^2 -2*n -5)/6) \\ G. C. Greubel, Aug 30 2019

[n*(n+1)*(12*n^2 -2*n -7)/6 for n in (0..40)] # G. C. Greubel, Aug 30 2019

a(n) = n*(n+1)*(12*n^2 - 2*n - 7)/6.
G.f.: x*(1 + 32*x + 15*x^2)/(1-x)^5. - Bruno Berselli, Feb 26 2011
E.g.f.: x*(6 + 105*x + 82*x^2 + 12*x^3)*exp(x)/6. - G. C. Greubel, Aug 30 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

A237616 a(n) = n*(n + 1)*(5*n - 4)/2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Magma

Magma

Maple

Mathematica

PARI

Sage

Formula

A152767 3 times 10-gonal (or decagonal) numbers: a(n) = 3*n*(4*n-3).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A213835 Rectangular array: (row n) = b**c, where b(h) = h, c(h) = 4*n-7+4*h, n>=1, h>=1, and ** = convolution.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A264851 a(n) = n*(n + 1)*(n + 2)*(4*n - 3)/6.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A172080 a(n) = n*(12*n^3 + 10*n^2 - 9*n - 7)/6.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

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

A237616 a(n) = n(n + 1)(5*n - 4)/2.

A152767 3 times 10-gonal (or decagonal) numbers: a(n) = 3n(4*n-3).

A213835 Rectangular array: (row n) = b**c, where b(h) = h, c(h) = 4n-7+4h, n>=1, h>=1, and ** = convolution.

A264851 a(n) = n(n + 1)(n + 2)(4n - 3)/6.

A172080 a(n) = n(12n^3 + 10n^2 - 9n - 7)/6.