A006319 -id:A006319 - cp's OEIS frontend

A033877 Triangular array read by rows associated with Schroeder numbers: T(1,k) = 1; T(n,k) = 0 if k < n; T(n,k) = T(n,k-1) + T(n-1,k-1) + T(n-1,k).

1, 1, 2, 1, 4, 6, 1, 6, 16, 22, 1, 8, 30, 68, 90, 1, 10, 48, 146, 304, 394, 1, 12, 70, 264, 714, 1412, 1806, 1, 14, 96, 430, 1408, 3534, 6752, 8558, 1, 16, 126, 652, 2490, 7432, 17718, 33028, 41586, 1, 18, 160, 938, 4080, 14002, 39152, 89898, 164512, 206098

Offset: 1

N. J. A. Sloane

A106579 is in some ways a better version of this sequence, but since this was entered first it will be the main entry for this triangle.
The diagonals of this triangle are self-convolutions of the main diagonal A006318: 1, 2, 6, 22, 90, 394, 1806, ... . - Philippe Deléham, May 15 2005
From Johannes W. Meijer, Sep 22 2010, Jul 15 2013: (Start)
Note that for the terms T(n,k) of this triangle n indicates the column and k the row.
The triangle sums, see A180662, link Schroeder's triangle with several sequences, see the crossrefs. The mirror of this triangle is A080247.
Quite surprisingly the Kn1p sums, p >= 1, are all related to A026003 and crystal ball sequences for n-dimensional cubic lattices (triangle offset is 0): Kn11(n) = A026003(n), Kn12(n) = A026003(n+2) - 1, Kn13(n) = A026003(n+4) - A005408(n+3), Kn14(n) =  A026003(n+6) - A001844(n+4), Kn15(n) = A026003(n+8) - A001845(n+5), Kn16(n) = A026003(n+10) - A001846(n+6), Kn17(n) = A026003(n+12) - A001847(n+7), Kn18(n) = A026003(n+14) - A001848(n+8), Kn19(n) = A026003(n+16) - A001849(n+9), Kn110(n) = A026003(n+18) - A008417(n+10), Kn111(n) = A026003(n+20) - A008419(n+11), Kn112(n) = A026003(n+22) - A008421(n+12). (End)
T(n,k) is the number of normal semistandard Young tableaux with two columns, one of height k and one of height n. The recursion can be seen by performing jeu de taquin deletion on all instances of the smallest value. (If there are two instances of the smallest value, jeu de taquin deletion will always shorten the right column first and the left column second.) - Jacob Post, Jun 19 2018

			Triangle starts:
  1;
  1,    2;
  1,    4,    6;
  1,    6,   16,   22;
  1,    8,   30,   68,   90;
  1,   10,   48,  146,  304,  394;
  1,   12,   70,  264,  714, 1412, 1806;
  ... - _Joerg Arndt_, Sep 29 2013

T. D. Noe, Rows k = 1..50 of triangle, flattened
Henry Bottomley, Illustration of initial terms
Kevin Brown, Hipparchus on Compound Statements, 1994-2010. - _Johannes W. Meijer_, Sep 22 2010
James East and Nicholas Ham, Lattice paths and submonoids of Z^2, arXiv:1811.05735 [math.CO], 2018.
G. Kreweras, Sur les hiérarchies de segments, Cahiers Bureau Universitaire Recherche Opérationnelle, Cahier 20, Inst. Statistiques, Univ. Paris, 1973.
G. Kreweras, Sur les hiérarchies de segments, Cahiers du Bureau Universitaire de Recherche Opérationnelle, Institut de Statistique, Université de Paris, #20 (1973). (Annotated scanned copy)
G. Kreweras, Aires des chemins surdiagonaux et application à un problème économique, Cahiers du Bureau universitaire de recherche opérationnelle Série Recherche 24 (1976): 1-8. [Annotated scanned copy]
J. W. Meijer, Famous numbers on a chessboard, Acta Nova, Volume 4, No.4, December 2010. pp. 589-598.
J. M. Oh, An explicit formula for the number of fuzzy subgroups of a finite abelian p-group of rank two, Iranian Journal of Fuzzy Systems, Dec 2013, Vol. 10 Issue 6, pp. 125-135.
E. Pergola and R. A. Sulanke, Schroeder Triangles, Paths and Parallelogram Polyominoes, J. Integer Sequences, 1 (1998), #98.1.7.
S. Samieinia, The number of continuous curves in digital geometry, Port. Math. 67 (1) (2010) 75-89, last table.
R. A. Sulanke, Objects counted by the central Delannoy numbers, J. Integer Seq. 6 (2003), Article 03.1.5, 19 pp.
Luis Verde-Star, A Matrix Approach to Generalized Delannoy and Schröder Arrays, J. Int. Seq., Vol. 24 (2021), Article 21.4.1.

Essentially same triangle as A080247 and A080245 but with rows read in reversed order. Also essentially the same triangle as A106579.
Cf. A000007, A006318, A006319, A006320, A006321, A008288, A080243.
Cf. A084938, A103885, A238112, A330801.
Cf. A001003 (row sums), A026003 (antidiagonal sums).
Triangle sums (see the comments): A001003 (Row1, Row2), A026003 (Kn1p, p >= 1), A006603 (Kn21), A227504 (Kn22), A227505 (Kn23), A006603(2*n) (Kn3), A001850 (Kn4), A227506 (Fi1), A010683 (Fi2).

a033877 n k = a033877_tabl !! n !! k
a033877_row n = a033877_tabl !! n
a033877_tabl = iterate
   (\row -> scanl1 (+) $ zipWith (+) ([0] ++ row) (row ++ [0])) [1]
-- Reinhard Zumkeller, Apr 17 2013

function t(n,k)
  if k le 0 or k gt n then return 0;
  elif k eq 1 then return 1;
  else return t(n,k-1) + t(n-1,k-1) + t(n-1,k);
  end if;
end function;
[t(n,k): k in [1..n], n in [1..12]]; // G. C. Greubel, Mar 23 2023

T := proc(n, k) option remember; if n=1 then return(1) fi; if kJohannes W. Meijer, Sep 22 2010, revised Jul 17 2013

Mathematica
```
T[1, ]:= 1; T[n, k_]/;(k
				
```

def A033877_row(n):
    @cached_function
    def prec(n, k):
        if k==n: return 1
        if k==0: return 0
        return prec(n-1,k-1)-2*sum(prec(n,k+i-1) for i in (2..n-k+1))
    return [(-1)^k*prec(n, n-k) for k in (0..n-1)]
for n in (1..10): print(A033877_row(n)) # Peter Luschny, Mar 16 2016

@CachedFunction
def t(n, k): # t = A033847
    if (k<0 or k>n): return 0
    elif (k==1): return 1
    else: return t(n, k-1) + t(n-1, k-1) + t(n-1, k)
flatten([[t(n,k) for k in range(1,n+1)] for n in range(1, 16)]) # G. C. Greubel, Mar 23 2023

As an upper right triangle: a(n, k) = a(n, k-1) + a(n-1, k-1) + a(n-1, k) if k >= n >= 0 and a(n, k) = 0 otherwise.
G.f.: Sum T(n, k)*x^n*y^k = (1-x*y-(x^2*y^2-6*x*y+1)^(1/2)) / (x*(2*y+x*y-1+(x^2*y^2-6*x*y+1)^(1/2))). - Vladeta Jovovic, Feb 16 2003
Another version of A000007 DELTA [0, 2, 1, 2, 1, 2, 1, 2, 1, 2, ...] = 1, 1, 0, 1, 2, 0, 1, 4, 6, 0, 1, 6, 16, 22, 0, 1, ..., where DELTA is Deléham's operator defined in A084938.
Sum_{n=1..floor((k+1)/2)} T(n+p-1, k-n+p) = A026003(2*p+k-3) - A008288(2*p+k-3, p-2), p >= 2, k >= 1. - Johannes W. Meijer, Sep 28 2013
From G. C. Greubel, Mar 23 2023: (Start)
(t(n, k) as a lower triangle)
t(n, k) = t(n, k-1) + t(n-1, k-1) + t(n-1, k) with t(n, 1) = 1.
t(n, n) = A006318(n-1).
t(2*n-1, n) = A330801(n-1).
t(2*n-2, n) = A103885(n-1), n > 1.
Sum_{k=1..n-1} t(n, k) = A238112(n), n > 1.
Sum_{k=1..n} t(n, k) = A001003(n).
Sum_{k=1..n-1} (-1)^(k-1)*t(n, k) = (-1)^n*A001003(n-1), n > 1.
Sum_{k=1..n} (-1)^(k-1)*t(n, k) = A080243(n-1).
Sum_{k=1..floor((n+1)/2)} t(n-k+1, k) = A026003(n-1). (End)

More terms from David W. Wilson

A213282 G.f. satisfies A(x) = G(x/(1-x)^3) where G(x) = 1 + x*G(x)^3 is the g.f. of A001764.

Original entry on oeis.org

1, 1, 6, 36, 236, 1656, 12192, 92960, 727824, 5817696, 47281472, 389533056, 3245867136, 27308274688, 231654031104, 1979205694464, 17016094611712, 147104972637696, 1277988764697600, 11151534242977792, 97692088569096192, 858890594909048832, 7575804347863105536

Offset: 0

Paul D. Hanna, Jun 08 2012

nonn

Compare to the g.f. B(x) of A006319 where B(x) = C(x/(1-x)^2) such that C(x) = 1 + x*C(x)^2 is the g.f. of the Catalan numbers (A000108).

			G.f.: A(x) = 1 + x + 6*x^2 + 36*x^3 + 236*x^4 + 1656*x^5 + 12192*x^6 +...
G.f.: A(x) = G(x/(1-x)^3) where G(x) = 1 + x*G(x)^3 is g.f. of A001764:
G(x) = 1 + x + 3*x^2 + 12*x^3 + 55*x^4 + 273*x^5 + 1428*x^6 +...

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Cf. A213281, A001764; variants: A006319 (royal paths in a lattice), A213336.

series(RootOf(G = 1 + G^3*x/(1-x)^3, G),x=0,30); # Mark van Hoeij, Apr 18 2013

/* G.f. A(x) = G(x/(1-x)^3) where G(x) = 1 + x*G(x)^3: */
{a(n)=local(A,G=1+x);for(i=1,n,G=1+x*G^3+x*O(x^n));A=subst(G,x,x/(1-x+x*O(x^n))^3);polcoeff(A,n)}
for(n=0,25,print1(a(n),", "))

/* G.f. A(x) = F(x*A(x)^3) where F(x) = 1 + x/F(-x)^3: */
{a(n)=local(F=1+x+x*O(x^n), A=1); for(i=1, n+1, F=1+x/subst(F^3, x, -x+x*O(x^n))); A=(serreverse(x/F^3)/x)^(1/3); polcoeff(A, n)}
for(n=0, 25, print1(a(n), ", "))

G.f. satisfies: A(x) = F(x*A(x)^3) where F(x) = 1 + x/F(-x)^3 is the g.f. of A213281.
G.f. A(x) satisfies: A(1 - G(-x)) = G(x) = 1 + x*G(x)^3 is the g.f. of A001764.
a(n) = Sum_{k=0..n} binomial(n+2*k-1,n-k) * binomial(3*k,k)/(2*k+1). - Seiichi Manyama, Oct 03 2023

A213336 G.f. satisfies A(x) = G(x/(1-x)^4) where G(x) = 1 + x*G(x)^4 is the g.f. of A002293.

Original entry on oeis.org

1, 1, 8, 64, 568, 5440, 54888, 574848, 6190872, 68132224, 762874568, 8663106496, 99536424952, 1155012037824, 13516570396968, 159340702404352, 1890451582396632, 22555522916988672, 270466907608087944, 3257754635421506368, 39397587357527547320

Offset: 0

Paul D. Hanna, Jun 09 2012

nonn

			G.f.: A(x) = 1 + x + 8*x^2 + 64*x^3 + 568*x^4 + 5440*x^5 + 54888*x^6 +...
G.f.: A(x) = G(x/(1-x)^4) where G(x) = 1 + x*G(x)^4 is g.f. of A002293:
G(x) = 1 + x + 4*x^2 + 22*x^3 + 140*x^4 + 969*x^5 + 7084*x^6 +...

Vincenzo Librandi, Table of n, a(n) for n = 0..100

Cf. A213335, A002293; variants: A006319, A213282.

Partial sums give A349310. - Seiichi Manyama, Oct 03 2023

/* G.f. A(x) = G(x/(1-x)^4) where G(x) = 1 + x*G(x)^4: */
{a(n)=local(A, G=1+x); for(i=1, n, G=1+x*G^4+x*O(x^n)); A=subst(G, x, x/(1-x+x*O(x^n))^4); polcoeff(A, n)}
for(n=0, 25, print1(a(n), ", "))

/* G.f. A(x) = F(x*A(x)^4) where F(x) = 1 + x/F(-x)^4: */
{a(n)=local(F=1+x+x*O(x^n),A=1); for(i=1, n+1, F=1+x/subst(F^4, x, -x+x*O(x^n))); A=(serreverse(x/F^4)/x)^(1/4);polcoeff(A, n)}
for(n=0, 25, print1(a(n), ", "))

G.f. satisfies: A(x) = F(x*A(x)^4) where F(x) = 1 + x/F(-x)^4 is the g.f. of A213335.
G.f. A(x) satisfies: A(1 - G(-x)) = G(x) = 1 + x*G(x)^4 is the g.f. of A002293.
a(n) = Sum_{k=0..n} binomial(n+3*k-1,n-k) * binomial(4*k,k)/(3*k+1). - Seiichi Manyama, Oct 03 2023

A080247 Formal inverse of triangle A080246. Unsigned version of A080245.

Original entry on oeis.org

1, 2, 1, 6, 4, 1, 22, 16, 6, 1, 90, 68, 30, 8, 1, 394, 304, 146, 48, 10, 1, 1806, 1412, 714, 264, 70, 12, 1, 8558, 6752, 3534, 1408, 430, 96, 14, 1, 41586, 33028, 17718, 7432, 2490, 652, 126, 16, 1, 206098

Offset: 0

Paul Barry, Feb 15 2003

Row sums are little Schroeder numbers A001003. Diagonal sums are generalized Fibonacci numbers A006603. Columns include A006318, A006319, A006320, A006321.
T(n,k) is the number of dissections of a convex (n+3)-gon by nonintersecting diagonals with exactly k diagonals emanating from a fixed vertex. Example: T(2,1)=4 because the dissections of the convex pentagon ABCDE having exactly one diagonal emanating from the vertex A are: {AC}, {AD}, {AC,EC} and {AD,BD}. - Emeric Deutsch, May 31 2004
For more triangle sums, see A180662, see the Schroeder triangle A033877 which is the mirror of this triangle. - Johannes W. Meijer, Jul 15 2013

			Triangle starts:
[0]    1
[1]    2,    1
[2]    6,    4,   1
[3]   22,   16,   6,   1
[4]   90,   68,  30,   8,  1
[5]  394,  304, 146,  48, 10,  1
[6] 1806, 1412, 714, 264, 70, 12, 1
...
From _Gary W. Adamson_, Jul 25 2011: (Start)
n-th row = top row of M^n, M = the following infinite square production matrix:
  2, 1, 0, 0, 0, ...
  2, 2, 1, 0, 0, ...
  2, 2, 2, 1, 0, ...
  2, 2, 2, 2, 1, ...
  ... (End)

Michael De Vlieger, Table of n, a(n) for n = 0..11475 (rows 0 <= n <= 150, flattened)
Paul Barry, Laurent Biorthogonal Polynomials and Riordan Arrays, arXiv preprint arXiv:1311.2292 [math.CA], 2013.
Paul Barry, Generalized Catalan Numbers Associated with a Family of Pascal-like Triangles, J. Int. Seq., Vol. 22 (2019), Article 19.5.8.
Paul Barry, Notes on Riordan arrays and lattice paths, arXiv:2504.09719 [math.CO], 2025. See pp. 21, 29.
James East and Nicholas Ham, Lattice paths and submonoids of Z^2, arXiv:1811.05735 [math.CO], 2018.
P. Flajolet and M. Noy, Analytic combinatorics of noncrossing configurations, Discrete Math. 204 (1999), 203-229.
Shishuo Fu and Yaling Wang, Bijective recurrences concerning two Schröder triangles, arXiv:1908.03912 [math.CO], 2019.
W.-j. Woan, The Lagrange inversion formula and divisibility properties, JIS 10 (2007) 07.7.8, example 5.

Cf. A000007, A033877 (mirror), A084938.

A080247:=(n,k)->(k+1)*add(binomial(n+1,k+j+1)*binomial(n+j,j),j=0..n-k)/(n+1):
seq(seq(A080247(n,k),k=0..n),n=0..9);

Clear[w] w[n_, k_] /; k < 0 || k > n := 0 w[0,0]=1 ; w[n_, k_] /; 0 <= k <= n && !n == k == 0 := w[n, k] = w[n-1,k-1] + w[n-1,k] + w[n,k+1] Table[w[n,k],{n,0,10},{k,0,n}] (* David Callan, Jul 03 2006 *)
T[n_, k_] := Binomial[n, k] Hypergeometric2F1[k - n, n + 1, k + 2, -1];
Table[T[n, k], {n, 0, 8}, {k, 0, n}] // Flatten (* Peter Luschny, Jan 08 2018 *)

T(n,k):=((k+1)*sum(2^m*binomial(n+1,m)*binomial(n-k-1,n-k-m),m,0,n-k))/(n+1); /* Vladimir Kruchinin, Jan 10 2022 */

def A080247_row(n):
    @cached_function
    def prec(n, k):
        if k==n: return 1
        if k==0: return 0
        return prec(n-1,k-1)-2*sum(prec(n,k+i-1) for i in (2..n-k+1))
    return [(-1)^(n-k)*prec(n, k) for k in (1..n)]
for n in (1..10): print(A080247_row(n)) # Peter Luschny, Mar 16 2016

G.f.: 2/(2+y*x-y+y*(x^2-6*x+1)^(1/2))/y/x. - Vladeta Jovovic, Feb 16 2003
Essentially same triangle as triangle T(n,k), n > 0 and k > 0, read by rows; given by [0, 2, 1, 2, 1, 2, 1, 2, 1, 2, ...] DELTA A000007 where DELTA is Deléham's operator defined in A084938.
T(n, k) = T(n-1, k-1) + 2*Sum_{j>=0} T(n-1, k+j) with T(0, 0) = 1 and T(n, k)=0 if k < 0. - Philippe Deléham, Jan 19 2004
T(n, k) = (k+1)*Sum_{j=0..n-k} (binomial(n+1, k+j+1)*binomial(n+j, j))/(n+1). - Emeric Deutsch, May 31 2004
Recurrence: T(0,0)=1; T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n,k+1). - David Callan, Jul 03 2006
T(n, k) = binomial(n, k)*hypergeom([k - n, n + 1], [k + 2], -1). - Peter Luschny, Jan 08 2018
T(n,k) = (k+1)/(n+1)*Sum_{m=0..n-k} 2^m*binomial(n+1,m)*binomial(n-k-1,n-k-m). - Vladimir Kruchinin, Jan 10 2022
From Peter Bala, Sep 16 2024: (Start)
Riordan array (S(x), x*S(x)), where S(x) = (1 - x - sqrt(1 - 6*x + x^2))/(2*x) is the g.f. of the large Schröder numbers A006318.
For integer m and n >= 1, (m + 2)*[x^n] S(x)^(m*n) = m*[x^n] (1/S(-x))^((m+2)*n). For cases of this identity see A103885 (m = 1), A333481 (m = 2) and A370102 (m = 3). (End)

A213252 G.f. satisfies: A(x) = 1 + x/A(-x)^2.

Original entry on oeis.org

1, 1, 2, -1, -10, 7, 88, -68, -946, 767, 11298, -9425, -144024, 122436, 1919440, -1653776, -26419778, 22992655, 372670246, -326863667, -5358911450, 4729547023, 78264621664, -69424933968, -1157715304760, 1031309398852, 17309542787288, -15474833826028

Offset: 0

Paul D. Hanna, Jun 07 2012

sign

			G.f.: A(x) = 1 + x + 2*x^2 - x^3 - 10*x^4 + 7*x^5 + 88*x^6 - 68*x^7 +...
where
x/A(-x)^2 = x + 2*x^2 - x^3 - 10*x^4 + 7*x^5 + 88*x^6 - 68*x^7 +...
A(x)^2 = 1 + 2*x + 5*x^2 + 2*x^3 - 18*x^4 - 10*x^5 + 151*x^6 + 88*x^7 +...
The g.f. G(x) of A006319 begins:
G(x) = 1 + x + 4*x^2 + 16*x^3 + 68*x^4 + 304*x^5 + 1412*x^6 + 6752*x^7 +...
where G(x) = A(x*G(x)^2) and G(x/A(x)^2) = A(x);
also, G(x) = F(x/(1-x)^2) where F(x) = 1 + x*F(x)^2 is g.f. of A000108:
F(x) = 1 + x + 2*x^2 + 5*x^3 + 14*x^4 + 42*x^5 + 132*x^6 + 429*x^7 +...

Paul D. Hanna, Table of n, a(n) for n = 0..200

Cf. A006319, A213281, A213335, A143045; A000108.

{a(n)=local(A=1+x);for(i=1,n,A=1+x/subst(A^2,x,-x+x*O(x^n)));polcoeff(A,n)}
for(n=0,40,print1(a(n),", "))

G.f. satisfies: A(x) = G(x/A(x)^2) where G(x) = A(x*G(x)^2) is the g.f. of A006319 (royal paths in a lattice).
G.f. satisfies: A(x) = sqrt( x/Series_Reversion( x*C(x/(1-x)^2)^2 ) ) where C(x) = 1 + x*C(x)^2 = (1-sqrt(1-4*x))/(2*x) is the g.f. of the Catalan numbers (A000108).
G.f. satisfies: A(x) = A(x)*A(-x) + x/A(x).

A360100 a(n) = Sum_{k=0..n} binomial(n+2k-1,n-k) Catalan(k).

Original entry on oeis.org

1, 1, 5, 23, 111, 562, 2952, 15948, 88076, 495077, 2823293, 16295020, 95007654, 558765743, 3310999269, 19748462718, 118471172054, 714355994997, 4327148812557, 26319195869861, 160677354596769, 984236344800234, 6047526697800992, 37262944840704171

Offset: 0

Seiichi Manyama, Jan 25 2023

nonn

Partial sums are A360102.
Cf. A162481, A258973.
Cf. A002212, A006319, A162475, A360101.
Cf. A000108.

A360100 := proc(n)
    add(binomial(n+2*k-1,n-k)*A000108(k),k=0..n) ;
end proc:
seq(A360100(n),n=0..70) ; # R. J. Mathar, Mar 12 2023

m = 24;
A[_] = 0;
Do[A[x_] = 1 + x A[x]^2/(1 - x)^3 + O[x]^m // Normal, {m}];
CoefficientList[A[x], x] (* Jean-François Alcover, Aug 16 2023 *)

a(n) = sum(k=0, n, binomial(n+2*k-1, n-k)*binomial(2*k, k)/(k+1));

my(N=30, x='x+O('x^N)); Vec(2/(1+sqrt(1-4*x/(1-x)^3)))

G.f. A(x) satisfies A(x) = 1 + x * A(x)^2 / (1-x)^3.
G.f.: c(x/(1-x)^3), where c(x) is the g.f. of A000108.
a(n) ~ sqrt(-2 + (35 - 3*sqrt(129))^(1/3) + (35 + 3*sqrt(129))^(1/3)) * (((7 + (262 - 6*sqrt(129))^(1/3) + (2*(131 + 3*sqrt(129)))^(1/3))/3)^n / (sqrt(2*Pi) * n^(3/2))). - Vaclav Kotesovec, Feb 18 2023
D-finite with recurrence (n+1)*a(n) +(-8*n+5)*a(n-1) +(10*n-27)*a(n-2) +(-4*n+17)*a(n-3) +(n-6)*a(n-4)=0. - R. J. Mathar, Mar 12 2023

cp's OEIS Frontend

A227505 Schroeder triangle sums: a(n) = A006603(n+3) - A006318(n+3) - A006319(n+2).

Views

Author

Keywords

Comments

Crossrefs

Programs

Maple

Formula

A073150 Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(1,0)=2, a(n,0)=A006318(n), a(n,n)=A006319(n), a(n+1,0)=a(n,0)+a(n,n), a(n,m+1)= Sum A006318(k)*a(n-k,0), k=0..m.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A073151 Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n+1,0)=A006319(n)=a(n,0) + Sum a(k,k), k=0..n-1. a(n,m+1)= a(n,0) + Sum A006319(k)*a(n-k-1,0), k=0..m-1.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A033877 Triangular array read by rows associated with Schroeder numbers: T(1,k) = 1; T(n,k) = 0 if k < n; T(n,k) = T(n,k-1) + T(n-1,k-1) + T(n-1,k).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

Sage

SageMath

Formula

Extensions

A213282 G.f. satisfies A(x) = G(x/(1-x)^3) where G(x) = 1 + x*G(x)^3 is the g.f. of A001764.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

PARI

PARI

Formula

A213336 G.f. satisfies A(x) = G(x/(1-x)^4) where G(x) = 1 + x*G(x)^4 is the g.f. of A002293.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

PARI

PARI

Formula

A080247 Formal inverse of triangle A080246. Unsigned version of A080245.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Maxima

Sage

A360100 a(n) = Sum_{k=0..n} binomial(n+2k-1,n-k) Catalan(k).