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-9 of 9 results.

A120902 Row sums of triangle A120898 (cascadence of 1+2x+x^2).

Original entry on oeis.org

1, 5, 23, 103, 450, 1932, 8196, 34468, 143997, 598463, 2476936, 10216818, 42023225, 172436363, 706132290, 2886574198, 11781962631, 48025519977, 195530083266, 795241236228, 3231290822280, 13118557603984, 53218706064038
Offset: 0

Views

Author

Paul D. Hanna, Jul 14 2006

Keywords

Crossrefs

Cf. A120898, A120899, A120900, A120901.

A120901 Central terms of triangle A120898 (cascadence of 1+2x+x^2).

Original entry on oeis.org

1, 1, 5, 14, 43, 156, 535, 1956, 7175, 26418, 98375, 367176, 1378022, 5193625, 19641164, 74535167, 283651169, 1082274210, 4139129734, 15863315213, 60913982404, 234317240601, 902804442380, 3483620505111, 13460665855850
Offset: 0

Views

Author

Paul D. Hanna, Jul 14 2006

Keywords

Crossrefs

Cf. A120898, A120899, A120900, A120902.

A092683 Triangle, read by rows, such that the convolution of each row with {1,1} produces a triangle which, when flattened, equals this flattened form of the original triangle.

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 3, 3, 2, 3, 6, 5, 5, 3, 6, 11, 10, 8, 9, 6, 11, 21, 18, 17, 15, 17, 11, 21, 39, 35, 32, 32, 28, 32, 21, 39, 74, 67, 64, 60, 60, 53, 60, 39, 74, 141, 131, 124, 120, 113, 113, 99, 113, 74, 141, 272, 255, 244, 233, 226, 212, 212, 187, 215, 141, 272, 527, 499
Offset: 0

Views

Author

Paul D. Hanna, Mar 04 2004

Keywords

Comments

First column and main diagonal forms A092684. Row sums form A092685.
This triangle is the cascadence of binomial (1+x). More generally, the cascadence of polynomial F(x) of degree d, F(0)=1, is a triangle with d*n+1 terms in row n where the g.f. of the triangle, A(x,y), is given by: A(x,y) = ( x*H(x) - y*H(x*y^d) )/( x*F(y) - y ), where H(x) satisfies: H(x) = G*H(x*G^d)/x and G=G(x) satisfies: G(x) = x*F(G(x)) so that G = series_reversion(x/F(x)); also, H(x) is the g.f. of column 0. - Paul D. Hanna, Jul 17 2006

Examples

			Rows begin:
1;
1, 1;
2, 1, 2;
3, 3, 2, 3;
6, 5, 5, 3, 6;
11, 10, 8, 9, 6, 11;
21, 18, 17, 15, 17, 11, 21;
39, 35, 32, 32, 28, 32, 21, 39;
74, 67, 64, 60, 60, 53, 60, 39, 74;
141, 131, 124, 120, 113, 113, 99, 113, 74, 141;
272, 255, 244, 233, 226, 212, 212, 187, 215, 141, 272;
527, 499, 477, 459, 438, 424, 399, 402, 356, 413, 272, 527;
1026, 976, 936, 897, 862, 823, 801, 758, 769, 685, 799, 527, 1026; ...
The convolution of each row with {1,1} gives the triangle:
1, 1;
1, 2, 1;
2, 3, 3, 2;
3, 6, 5, 5, 3;
6, 11, 10, 8, 9, 6;
11, 21, 18, 17, 15, 17, 11;
21, 39, 35, 32, 32, 28, 32, 21;
39, 74, 67, 64, 60, 60, 53, 60, 39; ...
which, when flattened, equals the original triangle in flattened form.

Links

Crossrefs

Cf. A092684, A092685, A092686, A092689, A120894, A120898.

Programs

  • PARI
    T(n,k)=if(n<0 || k>n,0, if(n==0 && k==0,1, if(n==1 && k<=1,1, if(k==n,T(n,0), T(n-1,k)+T(n-1,k+1)))))
for(n=0, 10, for(k=0, n, print1(T(n, k), ", ")); print(""))
  • PARI
    /* Generate Triangle by G.F. where F=1+x: */
{T(n,k)=local(A,F=1+x,d=1,G=x,H=1+x,S=ceil(log(n+1)/log(d+1))); for(i=0,n,G=x*subst(F,x,G+x*O(x^n)));for(i=0,S,H=subst(H,x,x*G^d+x*O(x^n))*G/x); A=(x*H-y*subst(H,x,x*y^d +x*O(x^n)))/(x*subst(F,x,y)-y); polcoeff(polcoeff(A,n,x),k,y)}
for(n=0, 10, for(k=0, n, print1(T(n, k), ", ")); print()) \\ Paul D. Hanna, Jul 17 2006

Formula

T(n, k) = T(n-1, k) + T(n-1, k+1) for 0<=k
G.f.: A(x,y) = ( x*H(x) - y*H(x*y) )/( x*(1+y) - y ), where H(x) satisfies: H(x) = H(x^2/(1-x))/(1-x) and H(x) is the g.f. of column 0 (A092684). - Paul D. Hanna, Jul 17 2006

A092686 Triangle, read by rows, such that the convolution of each row with {1,2} produces a triangle which, when flattened, equals this flattened form of the original triangle.

Original entry on oeis.org

1, 2, 2, 6, 4, 6, 16, 14, 12, 16, 46, 40, 40, 32, 46, 132, 120, 112, 110, 92, 132, 384, 352, 334, 312, 316, 264, 384, 1120, 1038, 980, 940, 896, 912, 768, 1120, 3278, 3056, 2900, 2776, 2704, 2592, 2656, 2240, 3278, 9612, 9012, 8576, 8256, 8000, 7840, 7552, 7758
Offset: 0

Views

Author

Paul D. Hanna, Mar 04 2004

Keywords

Comments

First column and main diagonal forms A092687. Row sums form A092688.
This triangle is the cascadence of binomial (1+2x). More generally, the cascadence of polynomial F(x) of degree d, F(0)=1, is a triangle with d*n+1 terms in row n where the g.f. of the triangle, A(x,y), is given by: A(x,y) = ( x*H(x) - y*H(x*y^d) )/( x*F(y) - y ), where H(x) satisfies: H(x) = G*H(x*G^d)/x and G=G(x) satisfies: G(x) = x*F(G(x)) so that G = series_reversion(x/F(x)); also, H(x) is the g.f. of column 0. - Paul D. Hanna, Jul 17 2006

Examples

			Rows begin:
1;
2, 2;
6, 4, 6;
16, 14, 12, 16;
46, 40, 40, 32, 46;
132, 120, 112, 110, 92, 132;
384, 352, 334, 312, 316, 264, 384;
1120, 1038, 980, 940, 896, 912, 768, 1120;
3278, 3056, 2900, 2776, 2704, 2592, 2656, 2240, 3278;
9612, 9012, 8576, 8256, 8000, 7840, 7552, 7758, 6556, 9612;
28236, 26600, 25408, 24512, 23840, 23232, 22862, 22072, 22724, 19224, 28236; ...
Convolution of each row with {1,2} results in the triangle:
1, 2;
2, 6, 4;
6, 16, 14, 12;
16, 46, 40, 40, 32;
46, 132, 120, 112, 110, 92;
132, 384, 352, 334, 312, 316, 264;
384, 1120, 1038, 980, 940, 896, 912, 768; ...
which, when flattened, equals the original triangle in flattened form.

Links

Crossrefs

Cf. A092683, A092687, A092688, A092689, A120894, A120898.

Programs

  • PARI
    T(n,k)=if(n<0 || k>n,0, if(n==0 && k==0,1, if(n==1 && k<=1,2, if(k==n,T(n,0), 2*T(n-1,k)+T(n-1,k+1)))))
for(n=0, 10, for(k=0, n, print1(T(n, k), ", ")); print(""))
  • PARI
    /* Generate Triangle by the G.F.: */
{T(n,k)=local(A,F=1+2*x,d=1,G=x,H=1+2*x,S=ceil(log(n+1)/log(d+1))); for(i=0,n,G=x*subst(F,x,G+x*O(x^n)));for(i=0,S,H=subst(H,x,x*G^d+x*O(x^n))*G/x); A=(x*H-y*subst(H,x,x*y^d +x*O(x^n)))/(x*subst(F,x,y)-y); polcoeff(polcoeff(A,n,x),k,y)}
for(n=0, 10, for(k=0, n, print1(T(n, k), ", ")); print()) \\ Paul D. Hanna, Jul 17 2006

Formula

T(n, k) = 2*T(n-1, k) + T(n-1, k+1) for 0<=k
G.f.: A(x,y) = ( x*H(x) - y*H(x*y) )/( x*(1+2y) - y ), where H(x) satisfies: H(x) = H(x^2/(1-2x))/(1-2x) and H(x) is the g.f. of column 0 (A092687). - Paul D. Hanna, Jul 17 2006

A120894 Cascadence of 1+x+x^2; a triangle, read by rows of 2n+1 terms, that retains its original form upon convolving each row with [1,1,1] and then letting excess terms spill over from each row into the initial positions of the next row such that only 2n+1 terms remain in row n for n>=0.

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 2, 1, 2, 5, 7, 6, 5, 3, 2, 5, 12, 18, 18, 14, 10, 10, 7, 5, 12, 30, 48, 50, 42, 34, 27, 22, 24, 17, 12, 30, 78, 128, 140, 126, 103, 83, 73, 63, 53, 59, 42, 30, 78, 206, 346, 394, 369, 312, 259, 219, 189, 175, 154, 131, 150, 108, 78, 206, 552, 946, 1109
Offset: 0

Views

Author

Paul D. Hanna, Jul 14 2006

Keywords

Comments

In this case, the g.f. of column 0, H(x), satisfies: H(x) = H(x*G^2)*G/x where G satisfies: G = x*(1+G+G^2), so that G/x = g.f. of Motzkin numbers (A001006). More generally, the cascadence of polynomial F(x) of degree d, F(0)=1, is a triangle with d*n+1 terms in row n where the g.f. H(x) of column 0 satisfies: H(x) = H(x*G^d)*G/x where G = x*F(G); thus G = series_reversion(x/F(x)), or, equivalently, [x^n] G = [x^n] x*F(x)^n/n for n>=1.
Further, the g.f. of the cascadence triangle for polynomial F(x) of degree d is given by: A(x,y) = ( x*H(x) - y*H(x*y^d) )/( x*F(y) - y ), where H(x) = G*H(x*G^d)/x and G = x*F(G). - Paul D. Hanna, Jul 17 2006

Examples

			Triangle begins:
1;
1, 1, 1;
2, 3, 2, 1, 2;
5, 7, 6, 5, 3, 2, 5;
12, 18, 18, 14, 10, 10, 7, 5, 12;
30, 48, 50, 42, 34, 27, 22, 24, 17, 12, 30;
78, 128, 140, 126, 103, 83, 73, 63, 53, 59, 42, 30, 78;
206, 346, 394, 369, 312, 259, 219, 189, 175, 154, 131, 150, 108, 78, 206;
552, 946, 1109, 1075, 940, 790, 667, 583, 518, 460, 435, 389, 336, 392, 284, 206, 552;
1498, 2607, 3130, 3124, 2805, 2397, 2040, 1768, 1561, 1413, 1284, 1160, 1117, 1012, 882, 1042, 758, 552, 1498; ...
Convolution of [1,1,1] with each row produces:
[1,1,1]*[1] = [1,1,1];
[1,1,1]*[1,1,1] = [1,2,3,2,1];
[1,1,1]*[2,3,2,1,2] = [2,5,7,6,5,3,2];
[1,1,1]*[5,7,6,5,3,2,5] = [5,12,18,18,14,10,10,7,5];
[1,1,1]*[12,18,18,14,10,10,7,5,12] = [12,30,48,50,42,34,27,22,24,17,12]; ...
These convoluted rows, when concatenated, yield the sequence:
1,1,1, 1,2,3,2,1, 2,5,7,6,5,3,2, 5,12,18,18,14,10,10,7,5, ...
which equals the concatenated rows of this original triangle:
1, 1,1,1, 2,3,2,1,2, 5,7,6,5,3,2,5, 12,18,18,14,10,10,7,5,12, ...

Links

Crossrefs

Cf. A120895 (column 0), A120896 (central terms), A120897 (row sums), A001006 (Motzkin numbers); variants: A092683, A092686, A120898.

Programs

  • PARI
    T(n,k)=if(2*n
  • PARI
    /* Generated by the G.F.: */
{T(n,k)=local(A,F=1+x+x^2,d=2,G=x,H=1+x,S=ceil(log(n+1)/log(d+1))); for(i=0,n,G=x*subst(F,x,G+x*O(x^n)));for(i=0,S,H=subst(H,x,x*G^d+x*O(x^n))*G/x); A=(x*H-y*subst(H,x,x*y^d +x*O(x^n)))/(x*subst(F,x,y)-y); polcoeff(polcoeff(A,n,x),k,y)}
for(n=0, 10, for(k=0, 2*n, print1(T(n, k), ", ")); print()) \\ Paul D. Hanna, Jul 17 2006

Formula

G.f.: A(x,y) = ( x*H(x) - y*H(x*y^2) )/( x*F(y) - y ), where H(x) = G*H(x*G^2)/x, G = x*F(G), F(x)=1+x+x^2. - Paul D. Hanna, Jul 17 2006

A120899 G.f. satisfies: A(x) = C(x)^2 * A(x^3*C(x)^4), where C(x) is the g.f. of the Catalan numbers (A000108).

Original entry on oeis.org

1, 2, 5, 16, 54, 186, 654, 2338, 8463, 30938, 114022, 423096, 1579049, 5922512, 22309350, 84354388, 320020227, 1217689680, 4645693038, 17766596202, 68092473570, 261486788434, 1005962436536, 3876412305114, 14960183283203
Offset: 0

Views

Author

Paul D. Hanna, Jul 14 2006

Keywords

Comments

Column 0 of triangle A120898 (cascadence of 1+2x+x^2). Self-convolution of A120900.

Examples

			A(x) = 1 + 2*x + 5*x^2 + 16*x^3 + 54*x^4 + 186*x^5 + 654*x^6 +...
= C(x)^2 * A(x^3*C(x)^4) where
C(x) = 1 + x + 2*x^2 + 5*x^3 + 14*x^4 + 42*x^5 + 132*x^6 +...
is the g.f. of the Catalan numbers (A000108): C(x) = 1 + x*C(x)^2.

Crossrefs

Cf. A120898, A120900 (square-root), A120901, A120902; A000108; variants: A092684, A092687, A120895.

Programs

  • PARI
    {a(n)=local(A=1+x,C=(1/x*serreverse(x/(1+2*x+x^2+x*O(x^n))))^(1/2)); for(i=0,n,A=C^2*subst(A,x,x^3*C^4 +x*O(x^n)));polcoeff(A,n,x)}

A120919 Cascadence of (1+x)^3; a triangle, read by rows of 3n+1 terms, that retains its original form upon convolving each row with [1,3,3,1] and then letting excess terms spill over from each row into the initial positions of the next row such that only 3n+1 terms remain in row n for n>=0.

Original entry on oeis.org

1, 3, 3, 1, 3, 12, 19, 18, 15, 10, 3, 12, 55, 111, 138, 128, 96, 66, 55, 39, 12, 55, 276, 636, 930, 1005, 876, 669, 498, 360, 263, 240, 177, 55, 276, 1464, 3666, 5979, 7317, 7242, 6138, 4737, 3506, 2607, 2046, 1569, 1212, 1170, 883, 276, 1464, 8058, 21369, 37716
Offset: 0

Views

Author

Paul D. Hanna, Jul 17 2006

Keywords

Examples

			Triangle begins:
1;
3, 3, 1, 3;
12, 19, 18, 15, 10, 3, 12;
55, 111, 138, 128, 96, 66, 55, 39, 12, 55;
276, 636, 930, 1005, 876, 669, 498, 360, 263, 240, 177, 55, 276;
Convolution of [1,3,3,1] with each row produces:
[1,3,3,1]*[1] = [1,3,3,1];
[1,3,3,1]*[3,3,1,3] = [3,12,19,18,15,10,3];
[1,3,3,1]*[12,19,18,15,10,3,12] = [12,55,111,138,128,96,66,55,39,12];
[1,3,3,1]*[55,111,138,128,96,66,55,39,12,55] =
[55,276,636,930,1005,876,669,498,360,263,240,177,55];
These convoluted rows, when concatenated, yield the sequence:
1,3,3,1, 3,12,19,18,15,10,3, 12,55,111,138,128,96,66,55,39,12, 55,...
which equals the concatenated rows of this original triangle:
1, 3,3,1,3, 12,19,18,15,10,3,12, 55,111,138,128,96,66,55,39,12,55, ...

Crossrefs

Cf. A120920 (column 0), A120922 (central terms), A120923 (row sums), A001764 (ternary trees); variants: A092683, A092686, A120894, A120898, A120919.

Programs

  • Mathematica
    T[n_, k_] := T[n, k] = If[3*n < k || k < 0, 0, If[n == 0 && k == 0, 1, If[k == 3*n, T[n, 0], T[n - 1, k + 1] + 3*T[n - 1, k] + 3*T[n - 1, k - 1] + T[n - 1, k - 2]]]];
Table[T[n, k], {n, 0, 10}, {k, 0, 3 n}] // Flatten (* Jean-François Alcover, Jan 24 2018, translated from PARI *)
  • PARI
    /* Generate Triangle by the Recurrence: */
{T(n,k)=if(3*n
  • PARI
    /* Generate Triangle by the G.F.: */
{T(n,k)=local(A,F=(1+x)^3,d=3,G=x,H=1+x,S=ceil(log(n+1)/log(d+1))); for(i=0,n,G=x*subst(F,x,G+x*O(x^n)));for(i=0,S,H=subst(H,x,x*G^d+x*O(x^n))*G/x); A=(x*H-y*subst(H,x,x*y^d +x*O(x^n)))/(x*subst(F,x,y)-y); polcoeff(polcoeff(A,n,x),k,y)}
for(n=0, 10, for(k=0, 3*n, print1(T(n, k), ", ")); print(""))

Formula

G.f.: A(x,y) = ( x*H(x) - y*H(x*y^3) )/( x*(1+y)^3 - y ), where H(x) satisfies: H(x) = G*H(x^4*G^3) and G(x) is g.f. of A001764: G(x) = 1 + x*G(x)^3.

A120914 Cascadence of (1+2x)^2; a triangle, read by rows of 2n+1 terms, that retains its original form upon convolving each row with [1,4,4] and then letting excess terms spill over from each row into the initial positions of the next row such that only 2n+1 terms remain in row n for n>=0.

Original entry on oeis.org

1, 4, 4, 4, 20, 36, 32, 16, 20, 116, 256, 288, 212, 144, 80, 116, 720, 1776, 2388, 2144, 1504, 1012, 784, 464, 720, 4656, 12372, 18800, 19632, 15604, 10848, 7648, 5712, 4736, 2880, 4656, 30996, 86912, 144320, 169332, 151792, 113456, 79696, 58176
Offset: 0

Views

Author

Paul D. Hanna, Jul 17 2006

Keywords

Comments

More generally, the cascadence of polynomial F(x) of degree d, F(0)=1, is a triangle with d*n+1 terms in row n where the g.f. of the triangle, A(x,y), is given by: A(x,y) = ( x*H(x) - y*H(x*y^d) )/( x*F(y) - y ), where H(x) satisfies: H(x) = G*H(x*G^d)/x and G satisfies: G = x*F(G) so that G = series_reversion(x/F(x)); also, H(x) is the g.f. of column 0.

Examples

			Triangle begins:
1;
4, 4, 4;
20, 36, 32, 16, 20;
116, 256, 288, 212, 144, 80, 116;
720, 1776, 2388, 2144, 1504, 1012, 784, 464, 720;
4656, 12372, 18800, 19632, 15604, 10848, 7648, 5712, 4736, 2880, 4656;
Convolution of [1,4,4] with each row produces:
[1,4,4]*[1] = [1,4,4];
[1,4,4]*[4,4,4] = [4,20,36,32,16];
[1,4,4]*[20,36,32,16,20] = [20,116,256,288,212,144,80];
[1,4,4]*[116,256,288,212,144,80,116] =
[116,720,1776,2388,2144,1504,1012,784,464];
These convoluted rows, when concatenated, yield the sequence:
1,4,4, 4,20,36,32,16, 20,116,256,288,212,144,80, 116,720,1776,2388,...
which equals the concatenated rows of this original triangle:
1, 4,4,4, 20,36,32,16,20, 116,256,288,212,144,80,116, 720,1776,2388,...

Crossrefs

Cf. A120915 (column 0), A120917 (central terms), A120918 (row sums), A000108 (Catalan); variants: A092683, A092686, A120894, A120898, A120919.

Programs

  • PARI
    /* Generate Triangle by the Recurrence: */
{T(n,k)=if(2*n
  • PARI
    /* Generate Triangle by the G.F.: */
{T(n,k)=local(A,F=1+4*x+4*x^2,d=2,G=x,H=1+x,S=ceil(log(n+1)/log(d+1))); for(i=0,n,G=x*subst(F,x,G+x*O(x^n)));for(i=0,S,H=subst(H,x,x*G^d+x*O(x^n))*G/x); A=(x*H-y*subst(H,x,x*y^d +x*O(x^n)))/(x*subst(F,x,y)-y); polcoeff(polcoeff(A,n,x),k,y)}
for(n=0,10,for(k=0,n,print1(T(n,k),", "));print(""))

Formula

G.f.: A(x,y) = ( x*H(x) - y*H(x*y^2) )/( x*(1+2y)^2 - y ), where H(x) satisfies: H(x) = G*H(x*G^2)/x and G satisfies: G = x*(1 + 2G)^2 ; also, H(x) is the g.f. of column 0.

A120900 G.f. satisfies: A(x) = C(x)*A(x^3*C(x)^4), where C(x) is the g.f. of the Catalan numbers (A000108).

Original entry on oeis.org

1, 1, 2, 6, 19, 62, 209, 722, 2539, 9054, 32654, 118876, 436171, 1611067, 5984943, 22344455, 83786875, 315397144, 1191324649, 4513742858, 17149228138, 65318912291, 249356597492, 953902701488, 3656057618727, 14037222220896
Offset: 0

Views

Author

Paul D. Hanna, Jul 14 2006

Keywords

Comments

Self-convolution equals A120899, which equals column 0 of triangle A120898 (cascadence of 1+2x+x^2).

Examples

			A(x) = 1 + x + 2*x^2 + 6*x^3 + 19*x^4 + 62*x^5 + 209*x^6 + 722*x^7 +...
= C(x) * A(x^3*C(x)^4) where
C(x) = 1 + x + 2*x^2 + 5*x^3 + 14*x^4 + 42*x^5 + 132*x^6 +...
is the g.f. of the Catalan numbers (A000108): C(x) = 1 + x*C(x)^2.

Crossrefs

Cf. A120898, A120899, A000108.

Programs

  • PARI
    {a(n)=local(A=1+x,C=(1/x*serreverse(x/(1+2*x+x^2+x*O(x^n))))^(1/2)); for(i=0,n,A=C*subst(A,x,x^3*C^4 +x*O(x^n)));polcoeff(A,n,x)}
Showing 1-9 of 9 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.