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

A003453 Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals up to rotation and reflection.

Original entry on oeis.org

1, 3, 6, 11, 17, 26, 36, 50, 65, 85, 106, 133, 161, 196, 232, 276, 321, 375, 430, 495, 561, 638, 716, 806, 897, 1001, 1106, 1225, 1345, 1480, 1616, 1768, 1921, 2091, 2262, 2451, 2641, 2850, 3060, 3290, 3521, 3773, 4026

Offset: 5

N. J. A. Sloane, Simon Plouffe

In other words, the number of 2-dissections of an n-gon modulo the dihedral action.
John W. Layman observes that this appears to be the alternating sum transform (PSumSIGN) of A005744.
Row 2 of the convolution array A213847. - Clark Kimberling, Jul 05 2012
Number of nonisomorphic outer planar graphs of order n >= 3 and size n+2. - Christian Barrientos and Sarah Minion, Feb 27 2018

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n=5..1000
Douglas Bowman and Alon Regev, Counting symmetry classes of dissections of a convex regular polygon, arXiv preprint arXiv:1209.6270 [math.CO], 2012. See Theorem 5(2).
P. Lisonek, Closed forms for the number of polygon dissections, Journal of Symbolic Computation 20 (1995), 595-601.
Petr Lisonek, Combinatorial families enumerated by quasi-polynomials, Journal of Combinatorial Theory, Series A, Volume 114, Issue 4, May 2007, Pages 619-630.
Ronald C. Read, On general dissections of a polygon, Aequat. math. 18 (1978) 370-388.
N. J. A. Sloane, Transforms
Index entries for linear recurrences with constant coefficients, signature (2,1,-4,1,2,-1).

Column 3 of A295634.

Cf. A005744, A213847, A295419.

T52:= proc(n)
if n mod 2 = 0 then (n-4)*(n-2)*(n+3)/24;
else (n-3)*(n^2-13)/24; fi end;
[seq(T52(n),n=5..80)]; # N. J. A. Sloane, Dec 28 2012

nd[n_]:=If[EvenQ[n],(n-4)(n-2) (n+3)/24,(n-3) (n^2-13)/24]; Array[nd,50,5] (* or *) LinearRecurrence[{2,1,-4,1,2,-1},{1,3,6,11,17,26},50] (* Harvey P. Dale, Jan 28 2013 *)

\\ See A295419 for DissectionsModDihedral()
{ my(v=DissectionsModDihedral(apply(i->y + O(y^4), [1..40]))); apply(p->polcoeff(p, 3), v[5..#v]) } \\ Andrew Howroyd, Nov 24 2017

G.f.: (1+x-x^2) / ((1-x)^4*(1+x)^2).
See also the Maple code.
a(5)=1, a(6)=3, a(7)=6, a(8)=11, a(9)=17, a(10)=26, a(n) = 2*a(n-1) + a(n-2) - 4*a(n-3) + a(n-4) + 2*a(n-5) - a (n-6). - Harvey P. Dale, Jan 28 2013
a(n) = (2*n^3-6*n^2-23*n+63+3*(n-5)*(-1)^n)/48, for n>=5. - Luce ETIENNE, Apr 07 2015
a(n) = (1/2) * Sum_{i=1..n-4} floor((i+1)*(n-i-2)/2). - Wesley Ivan Hurt, May 07 2016

Entry revised (following Bowman and Regev) by N. J. A. Sloane, Dec 28 2012

Name clarified by Andrew Howroyd, Nov 24 2017

A180324 Vassiliev invariant of fourth order for the torus knots.

Original entry on oeis.org

0, 3, 25, 98, 270, 605, 1183, 2100, 3468, 5415, 8085, 11638, 16250, 22113, 29435, 38440, 49368, 62475, 78033, 96330, 117670, 142373, 170775, 203228, 240100, 281775, 328653, 381150, 439698, 504745, 576755, 656208, 743600, 839443, 944265, 1058610, 1183038, 1318125

Offset: 0

Sergey Allenov, Jan 18 2011

a(n) is the Vassiliev invariant of fourth order for the torus knots. a(n) can be calculated as the number of attachments of the two arrow diagrams in the arrow diagram of the torus knot. Arrow diagram of the torus knot is 2n+1 intersecting arrows with mixing ends.
Antidiagonal sums of the convolution array A213847. - Clark Kimberling, Jul 05 2012
First differences of the terms produced by convolving the odd and even triangular numbers, with  n>0. The sequence begins 0, 3, 28, 126, 396, 1001, 2184, 4284, 7752, 13167, 21252..starting at n=1 and has the formula (4*n^5 - 5*n^3 + 30*n)/30. - J. M. Bergot, Sep 09 2016

			a(1) = 1*2*3^2/6 = 3.
a(2) = 2*(2+1)*(2*2+1)^2/6 = 5^2 = 25.

S. V. Allenov, Explicit formulas for Vassil'ev invariants of the fourth order for knots, Journal of Mathematical Sciences, New York: Springer, Vol. 157, No. 3 (2009), pp. 413-423.
Michael Polyak and Oleg Viro, Gauss diagram formulas for Vassiliev invariants, Int. Math. Res. Notices, No. 11 (1994), pp. 445-453.
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

Cf. A000217, A000330, A185096, A213847, A322677, A339483.

a:=n->(1/6)*n*(n+1)*(2*n+1)^2;
a:=n->binomial(2*n+2, 4)+binomial(2*n+2, 3)/2;

Table[Binomial[2n+2,4]+Binomial[2n+2,3]/2,{n,0,40}] (* Harvey P. Dale, Sep 18 2018 *)
Table[Sum[x^2 + y^2, {x, -g, g}, {y, -g, g}], {g, 0, 33}]/4 (* Horst H. Manninger, Jun 19 2025 *)

PARI
```
a(n) = n*(n+1)*(2*n+1)^2/6
```

a(n) = (n*(n+1)*(2*n+1)^2)/6.
a(n) = C(2*n+2,4) + C(2*n+2,3)/2.
a(n) = (2*n+1)*A000330(n).
a(n) = 3*A000330(n)^2/A000217(n).
a(n) = (A000330(1) + A000330(2) + ... + A000330(2*n-1) + A000330(2*n))/2.
G.f.: x*(3+x)*(1+3*x)/(1-x)^5. - Colin Barker, Mar 17 2012
Sum_{n>=1} 1/a(n) = 30 - 3*Pi^2. - Amiram Eldar, Jun 20 2025
From Elmo R. Oliveira, Aug 20 2025: (Start)
E.g.f.: exp(x)*x*(2 + x)*(9 + 24*x + 4*x^2)/6.
a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5).
a(n) = A322677(n)/96 = A185096(n)/12 = A339483(n)/3. (End)

cp's OEIS Frontend

A213848 Principal diagonal of the convolution array A213847.

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

A003453 Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals up to rotation and reflection.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A180324 Vassiliev invariant of fourth order for the torus knots.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

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.