

A001263


Triangle of Narayana numbers T(n,k) = C(n1,k1)*C(n,k1)/k with 1 <= k <= n, read by rows. Also called the Catalan triangle.


366



1, 1, 1, 1, 3, 1, 1, 6, 6, 1, 1, 10, 20, 10, 1, 1, 15, 50, 50, 15, 1, 1, 21, 105, 175, 105, 21, 1, 1, 28, 196, 490, 490, 196, 28, 1, 1, 36, 336, 1176, 1764, 1176, 336, 36, 1, 1, 45, 540, 2520, 5292, 5292, 2520, 540, 45, 1, 1, 55, 825, 4950, 13860, 19404, 13860, 4950, 825
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,5


COMMENTS

Number of antichains (or order ideals) in the poset 2*(k1)*(nk) or plane partitions with rows <= k1, columns <= nk and entries <= 2.  Mitch Harris, Jul 15 2000
T(n,k) is the number of Dyck npaths with exactly k peaks. a(n,k) = number of pairs (P,Q) of lattice paths from (0,0) to (k,n+1k), each consisting of unit steps East or North, such that P lies strictly above Q except at the endpoints.  David Callan, Mar 23 2004
Number of permutations of [n] which avoid132 and have k1 descents.  Mike Zabrocki, Aug 26 2004
T(n,k) is the number of paths through n panes of glass, entering and leaving from one side, of length 2n with k reflections (where traversing one pane of glass is the unit length).  Mitch Harris, Jul 06 2006
Antidiagonal sums given by A004148 (without first term).
T(n,k) is the number of full binary trees with n internal nodes and k1 jumps. In the preorder traversal of a full binary tree, any transition from a node at a deeper level to a node on a strictly higher level is called a jump.  Emeric Deutsch, Jan 18 2007
The nth row can be generated by the following operation using an ascending row of (n1) triangular terms, (A) and a descending row, (B); e.g., row 6:
A: 1....3....6....10....15
B: 15...10....6.....3.....1
C: 1...15...50....50....15....1 = row 6.
Leftmost column of A,B > first two terms of C; then followed by the operation B*C/A of current column = next term of row C, (e.g., 10*15/3 = 50). Continuing with the operation, we get row 6: (1, 15, 50, 50, 15, 1). (End)
The previous comment can be upgraded to: The ConvOffsStoT transform of the triangular series; and by rows, row 6 is the ConvOffs transform of (1, 3, 6, 10, 15). Refer to triangle A117401 as another example of the ConvOffsStoT transform, and OEIS under Maple Transforms.  Gary W. Adamson, Jul 09 2012
T(n,k) is also the number of orderdecreasing and orderpreserving mappings (of an nelement set) of height k (height of a mapping is the cardinal of its image set).  Abdullahi Umar, Aug 21 2008
Row n of this triangle is the hvector of the simplicial complex dual to an associahedron of type A_n [Fomin & Reading, p.60]. See A033282 for the corresponding array of fvectors for associahedra of type A_n. See A008459 and A145903 for the hvectors for associahedra of type B and type D respectively. The Hilbert transform of this triangle (see A145905 for the definition of this transform) is A145904.  Peter Bala, Oct 27 2008
T(n,k) is also the number of noncrossing set partitions of [n] into k blocks. Given a partition P of the set {1,2,...,n}, a crossing in P are four integers [a, b, c, d] with 1 <= a < b < c < d <= n for which a, c are together in a block, and b, d are together in a different block. A noncrossing partition is a partition with no crossings.  Peter Luschny, Apr 29 2011
Noncrossing set partitions are also called genus 0 partitions. In terms of genusdependent Stirling numbers of the second kind S2(n,k,g) that count partitions of genus g of an nset into k nonempty subsets, one has T(n,k) = S2(n,k,0).  Robert Coquereaux, Feb 15 2024
Let E(y) = Sum_{n >= 0} y^n/(n!*(n+1)!) = 1/sqrt(y)*BesselI(1,2*sqrt(y)). Then this triangle is the generalized Riordan array (E(y), y) with respect to the sequence n!*(n+1)! as defined in Wang and Wang.
Generating function E(y)*E(x*y) = 1 + (1 + x)*y/(1!*2!) + (1 + 3*x + x^2)*y^2/(2!*3!) + (1 + 6*x + 6*x^2 + x^3)*y^3/(3!*4!) + .... Cf. A105278 with a generating function exp(y)*E(x*y).
The nth power of this array has a generating function E(y)^n*E(x*y). In particular, the matrix inverse A103364 has a generating function E(x*y)/E(y). (End)
T(n,k) is the number of nonintersecting n arches above the x axis, starting and ending on vertices 1 to 2n, with k being the number of arches starting on an odd vertice and ending on a higher even vertice. Example: T(3,2)=3 [16,25,34] [14,23,56] [12,36,45].  Roger Ford, Jun 14 2014
Fomin and Reading on p. 31 state that the rows of the Narayana matrix are the hvectors of the associahedra as well as its dual.  Tom Copeland, Jun 27 2017
The row polynomials P(n, x) = Sum_{k=1..n} T(n, k)*x^(k1), together with P(0, x) = 1, multiplied by (n+1) are the numerator polynomials of the o.g.f.s of the diagonal sequences of the triangle A103371: G(n, x) = (n+1)*P(n, x)/(1  x)^{2*n+1}, for n >= 0. This is proved with Lagrange's theorem applied to the Riordan triangle A135278 = (1/(1  x)^2, x/(1  x)). See an example below.  Wolfdieter Lang, Jul 31 2017
T(n,k) is the number of Dyck paths of semilength n with k1 uublocks (pairs of consecutive upsteps).  Alexander Burstein, Jun 22 2020
In case you were searching for Narayama numbers, the correct spelling is Narayana.  N. J. A. Sloane, Nov 11 2020
Named after the Canadian mathematician Tadepalli Venkata Narayana (19301987). They were also called "Runyon numbers" after John P. Runyon (19222013) of Bell Telephone Laboratories, who used them in a study of a telephone traffic system.  Amiram Eldar, Apr 15 2021 The Narayana numbers were first studied by Percy Alexander MacMahon (see reference, Article 495) as pointed out by Bóna and Sagan (see link).  Peter Luschny, Apr 28 2022
T(n,k) is the degree distribution of the paths towards synchronization in the transition diagram associated with the Laplacian system over the complete graph K_n, corresponding to ordered initial conditions x_1 < x_2 < ... < x_n.
T(n,k) for n=2N+1 and k=N+1 is the number of states in the transition diagram associated with the Laplacian system over the complete bipartite graph K_{N,N}, corresponding to ordered (x_1 < x_2 < ... < x_N and x_{N+1} < x_{N+2} < ... < x_{2N}) and balanced (Sum_{i=1..N} x_i/N = Sum_{i=N+1..2N} x_i/N) initial conditions. (End)
Also the number of unlabeled ordered rooted trees with n nodes and k leaves. See the link by Marko Riedel. For example, row n = 5 counts the following trees:
((((o)))) (((o))o) ((o)oo) (oooo)
(((o)o)) ((oo)o)
(((oo))) ((ooo))
((o)(o)) (o(o)o)
((o(o))) (o(oo))
(o((o))) (oo(o))
The unordered version is A055277. Leaves in standard ordered trees are counted by A358371.
(End)


REFERENCES

Berman and Koehler, Cardinalities of finite distributive lattices, Mitteilungen aus dem Mathematischen Seminar Giessen, 121 (1976), pp. 103124.
Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, page 196.
P. A. MacMahon, Combinatory Analysis, Vols. 1 and 2, Cambridge University Press, 1915, 1916; reprinted by Chelsea, 1960, Sect. 495.
T. V. Narayana, Sur les treillis formés par les partitions d'un entier et leurs applications à la théorie des probabilités, Comptes Rendus de l'Académie des Sciences Paris, Vol. 240 (1955), p. 11881189.
T. V. Narayana, Lattice Path Combinatorics with Statistical Applications. Univ. Toronto Press, 1979, pp. 100101.
A. Nkwanta, Lattice paths and RNA secondary structures, in African Americans in Mathematics, ed. N. Dean, Amer. Math. Soc., 1997, pp. 137147.
T. K. Petersen, Eulerian Numbers, Birkhäuser, 2015, Chapter 2.
J. Riordan, Combinatorial Identities, Wiley, 1968, p. 17.
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Problem 6.36(a) and (b).


LINKS

Axel Bacher, Antonio Bernini, Luca Ferrari, Benjamin Gunby, Renzo Pinzani, and Julian West, The Dyck pattern poset Discrete Math. 321 (2014), 1223. MR3154009.
Aubrey Blecher, Charlotte Brennan, Arnold Knopfmacher, and Toufik Mansour, The perimeter of words, Discrete Mathematics, 340, no. 10 (2017): 24562465.
R. Cori and G. Hetyei, How to count genus one partitions, FPSAC 2014, Chicago, Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France, 2014, 333344.
G. Kreweras, Sur les éventails de segments, Cahiers du Bureau Universitaire de Recherche Opérationnelle, Institut de Statistique, Université de Paris, #15 (1970), 341. [Annotated scanned copy]
G. Kreweras, Sur les éventails de segments, Cahiers du Bureau Universitaire de Recherche Opérationnelle, Institut de Statistique, Université de Paris, #15 (1970), 341.
Vincent Pilaud and V. Pons, Permutrees, arXiv:1606.09643 [math.CO], 20162017.
Tad White, Quota Trees, arXiv:2401.01462 [math.CO], 2024. See pp. 1920.


FORMULA

a(n, k) = C(n1, k1)*C(n, k1)/k for k!=0; a(n, 0)=0.
Triangle equals [0, 1, 0, 1, 0, 1, ...] DELTA [1, 0, 1, 0, 1, 0, 1, 0, ...] where DELTA is Deléham's operator defined in A084938.
0<n, 1<=k<=n a(n, 1) = a(n, n) = 1 a(n, k) = sum(i=1..n1, sum(r=1..k1, a(n1i, kr) a(i, r))) + a(n1, k) a(n, k) = sum(i=1..k1, binomial(n+i1, 2k2)*a(k1, i))  Mike Zabrocki, Aug 26 2004
T(n, k) = C(n, k)*C(n1, k1)  C(n, k1)*C(n1, k) (determinant of a 2 X 2 subarray of Pascal's triangle A007318).  Gerald McGarvey, Feb 24 2005
T(n, k) = binomial(n1, k1)^2  binomial(n1, k)*binomial(n1, k2).  David Callan, Nov 02 2005
a(n,k) = C(n,2) (a(n1,k)/((nk)*(nk+1)) + a(n1,k1)/(k*(k1))) a(n,k) = C(n,k)*C(n,k1)/n.  Mitch Harris, Jul 06 2006
G.f.: (1x*(1+y)sqrt((1x*(1+y))^24*y*x^2))/(2*x) = Sum_{n>0, k>0} a(n, k)*x^n*y^k.
Relation with Jacobi polynomials of parameter (1,1):
Row n+1 generating polynomial equals 1/(n+1)*x*(1x)^n*Jacobi_P(n,1,1,(1+x)/(1x)). It follows that the zeros of the Narayana polynomials are all real and nonpositive, as noted above. O.g.f for column k+2: 1/(k+1) * y^(k+2)/(1y)^(k+3) * Jacobi_P(k,1,1,(1+y)/(1y)). Cf. A008459.
T(n+1,k) is the number of walks of n unit steps on the square lattice (i.e., each step in the direction either up (U), down (D), right (R) or left (L)) starting from the origin and finishing at lattice points on the x axis and which remain in the upper halfplane y >= 0 [Guy]. For example, T(4,3) = 6 counts the six walks RRL, LRR, RLR, UDL, URD and RUD, from the origin to the lattice point (1,0), each of 3 steps. Compare with tables A145596  A145599.
Define a functional I on formal power series of the form f(x) = 1 + ax + bx^2 + ... by the following iterative process. Define inductively f^(1)(x) = f(x) and f^(n+1)(x) = f(x*f^(n)(x)) for n >= 1. Then set I(f(x)) = lim_{n > infinity} f^(n)(x) in the xadic topology on the ring of formal power series; the operator I may also be defined by I(f(x)) := 1/x*series reversion of x/f(x).
The o.g.f. for this array is I(1 + t*x + t*x^2 + t*x^3 + ...) = 1 + t*x + (t + t^2)*x^2 + (t + 3*t^2 + t^3)*x^3 + ... = 1/(1  x*t/(1  x/(1  x*t/(1  x/(1  ...))))) (as a continued fraction). Cf. A108767, A132081 and A141618. (End)
G.f.: 1/(1xxyx^2y/(1xxyx^2y/(1... (continued fraction).  Paul Barry, Sep 28 2010
E.g.f.: exp((1+y)x)*Bessel_I(1,2*sqrt(y)x)/(sqrt(y)*x).  Paul Barry, Sep 28 2010
G.f.: A(x,y) = exp( Sum_{n>=1} [Sum_{k=0..n} C(n,k)^2*y^k] * x^n/n ).  Paul D. Hanna, Oct 13 2010
With F(x,t) = (1(1+t)*xsqrt(12*(1+t)*x+((t1)*x)^2))/(2*x) an o.g.f. in x for the Narayana polynomials in t, G(x,t) = x/(t+(1+t)*x+x^2) is the compositional inverse in x. Consequently, with H(x,t) = 1/ (dG(x,t)/dx) = (t+(1+t)*x+x^2)^2 / (tx^2), the nth Narayana polynomial in t is given by (1/n!)*((H(x,t)*D_x)^n)x evaluated at x=0, i.e., F(x,t) = exp(x*H(u,t)*D_u)u, evaluated at u = 0. Also, dF(x,t)/dx = H(F(x,t),t).  Tom Copeland, Sep 04 2011
With offset 0, A001263 = Sum_{j>=0} A132710^j / A010790(j), a normalized Bessel fct. May be represented as the Pascal matrix A007318, n!/[(nk)!*k!], umbralized with b(n)=A002378(n) for n>0 and b(0)=1: A001263(n,k)= b.(n!)/{b.[(nk)!]*b.(k!)} where b.(n!) = b(n)*b(n1)...*b(0), a generalized factorial (see example).  Tom Copeland, Sep 21 2011
With F(x,t) = {1(1t)*xsqrt[12*(1+t)*x+[(t1)*x]^2]}/2 a shifted o.g.f. in x for the Narayana polynomials in t, G(x,t)= x/[t1+1/(1x)] is the compositional inverse in x. Therefore, with H(x,t)=1/(dG(x,t)/dx)=[t1+1/(1x)]^2/{t[x/(1x)]^2}, (see A119900), the (n1)th Narayana polynomial in t is given by (1/n!)*((H(x,t)*d/dx)^n)x evaluated at x=0, i.e., F(x,t) = exp(x*H(u,t)*d/du) u, evaluated at u = 0. Also, dF(x,t)/dx = H(F(x,t),t).  Tom Copeland, Sep 30 2011
T(n,k) = binomial(n1,k1)*binomial(n+1,k)binomial(n,k1)*binomial(n,k).  Philippe Deléham, Nov 05 2011
Damped sum of a column, in leading order: lim_{d>0} d^(2k1) Sum_{N>=k} T(N,k)(1d)^N=Catalan(n).  Joachim Wuttke, Sep 11 2014
Multiplying the nth column by n! generates the revert of the unsigned Lah numbers, A089231.  Tom Copeland, Jan 07 2016
Row polynomials: (x  1)^(n+1)*(P(n+1,(1 + x)/(x  1))  P(n1,(1 + x)/(x  1)))/((4*n + 2)), n = 1,2,... and where P(n,x) denotes the nth Legendre polynomial.  Peter Bala, Mar 03 2017
The coefficients of the row polynomials R(n, x) = hypergeom([n,n1], [2], x) generate the triangle based in (0,0).  Peter Luschny, Mar 19 2018
Multiplying the nth diagonal by n!, with the main diagonal n=1, generates the Lah matrix A105278. With G equal to the infinitesimal generator of A132710, the Narayana triangle equals Sum_{n >= 0} G^n/((n+1)!*n!) = (sqrt(G))^(1) * I_1(2*sqrt(G)), where G^0 is the identity matrix and I_1(x) is the modified Bessel function of the first kind of order 1. (cf. Sep 21 2011 formula also.)  Tom Copeland, Sep 23 2020
T(n,k) = T(n,k1)*C(nk+2,2)/C(k,2).  Yuchun Ji, Dec 21 2020


EXAMPLE

The initial rows of the triangle are:
[1] 1
[2] 1, 1
[3] 1, 3, 1
[4] 1, 6, 6, 1
[5] 1, 10, 20, 10, 1
[6] 1, 15, 50, 50, 15, 1
[7] 1, 21, 105, 175, 105, 21, 1
[8] 1, 28, 196, 490, 490, 196, 28, 1
[9] 1, 36, 336, 1176, 1764, 1176, 336, 36, 1;
...
For all n, 12...n (1 block) and 123...n (n blocks) are noncrossing set partitions.
Example of umbral representation:
A007318(5,k)=[1,5/1,5*4/(2*1),...,1]=(1,5,10,10,5,1),
so A001263(5,k)={1,b(5)/b(1),b(5)*b(4)/[b(2)*b(1)],...,1}
= [1,30/2,30*20/(6*2),...,1]=(1,15,50,50,15,1).
First = last term = b.(5!)/[b.(0!)*b.(5!)]= 1.  Tom Copeland, Sep 21 2011
Row polynomials and diagonal sequences of A103371: n = 4, P(4, x) = 1 + 6*x + 6*x^2 + x^3, and the o.g.f. of fifth diagonal is G(4, x) = 5* P(4, x)/(1  x)^9, namely [5, 75, 525, ...]. See a comment above.  Wolfdieter Lang, Jul 31 2017


MAPLE

A001263 := (n, k)>binomial(n1, k1)*binomial(n, k1)/k;
a:=proc(n, k) option remember; local i; if k=1 or k=n then 1 else add(binomial(n+i1, 2*k2)*a(k1, i), i=1..k1); fi; end:
# Alternatively, as a (0, 0)based triangle:
R := n > simplify(hypergeom([n, n1], [2], x)): Trow := n > seq(coeff(R(n, x), x, j), j=0..n): seq(Trow(n), n=0..9); # Peter Luschny, Mar 19 2018


MATHEMATICA

T[n_, k_] := If[k==0, 0, Binomial[n1, k1] Binomial[n, k1] / k];
Flatten[Table[Binomial[n1, k1] Binomial[n, k1]/k, {n, 15}, {k, n}]] (* Harvey P. Dale, Feb 29 2012 *)
TRow[n_] := CoefficientList[Hypergeometric2F1[1  n, n, 2, x], x];
Table[TRow[n], {n, 1, 11}] // Flatten (* Peter Luschny, Mar 19 2018 *)
aot[n_]:=If[n==1, {{}}, Join@@Table[Tuples[aot/@c], {c, Join@@Permutations/@IntegerPartitions[n1]}]];
Table[Length[Select[aot[n], Length[Position[#, {}]]==k&]], {n, 2, 9}, {k, 1, n1}] (* Gus Wiseman, Jan 23 2023 *)


PROG

(PARI) {a(n, k) = if(k==0, 0, binomial(n1, k1) * binomial(n, k1) / k)};
(PARI) {T(n, k)=polcoeff(polcoeff(exp(sum(m=1, n, sum(j=0, m, binomial(m, j)^2*y^j)*x^m/m) +O(x^(n+1))), n, x), k, y)} \\ Paul D. Hanna, Oct 13 2010
(Haskell)
a001263 n k = a001263_tabl !! (n1) !! (k1)
a001263_row n = a001263_tabl !! (n1)
a001263_tabl = zipWith dt a007318_tabl (tail a007318_tabl) where
dt us vs = zipWith () (zipWith (*) us (tail vs))
(zipWith (*) (tail us ++ [0]) (init vs))
(Magma) /* triangle */ [[Binomial(n1, k1)*Binomial(n, k1)/k : k in [1..n]]: n in [1.. 15]]; // Vincenzo Librandi, Oct 19 2014
(Sage)
@CachedFunction
def T(n, k):
if k == n or k == 1: return 1
if k <= 0 or k > n: return 0
return binomial(n, 2) * (T(n1, k)/((nk)*(nk+1)) + T(n1, k1)/(k*(k1)))
for n in (1..9): print([T(n, k) for k in (1..n)]) # Peter Luschny, Oct 28 2014
(GAP) Flat(List([1..11], n>List([1..n], k>Binomial(n1, k1)*Binomial(n, k1)/k))); # Muniru A Asiru, Jul 12 2018


CROSSREFS

Row sums give A000108 (Catalan numbers), n>0.
Triangles of generalized binomial coefficients (n,k)_m (or generalized Pascal triangles) for m = 1,...,12: A007318 (Pascal), A001263, A056939, A056940, A056941, A142465, A142467, A142468, A174109, A342889, A342890, A342891.


KEYWORD



AUTHOR



EXTENSIONS

Deleted certain dangerous or potentially dangerous links.  N. J. A. Sloane, Jan 30 2021


STATUS

approved



