This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A033184 Catalan triangle A009766 transposed. 86

%I

%S 1,1,1,2,2,1,5,5,3,1,14,14,9,4,1,42,42,28,14,5,1,132,132,90,48,20,6,1,

%T 429,429,297,165,75,27,7,1,1430,1430,1001,572,275,110,35,8,1,4862,

%U 4862,3432,2002,1001,429,154,44,9,1

%N Catalan triangle A009766 transposed.

%C Triangle read by rows: T(n,k) = number of Dyck n-paths (A000108) containing k returns to ground level. E.g., the paths UDUUDD, UUDDUD each have 2 returns; so T(3,2)=2. Row sums over even-indexed columns are the Fine numbers A000957. - _David Callan_, Jul 25 2005

%C Triangular array of numbers a(n,k) = number of linear forests of k planted planar trees and n non-root nodes.

%C Catalan convolution triangle; with offset [0,0]: a(n,m)=(m+1)*binomial(2*n-m,n-m)/(n+1), n >= m >= 0, else 0. G.f. for column m: c(x)*(x*c(x))^m with c(x) g.f. for A000108 (Catalan). - _Wolfdieter Lang_, Sep 12 2001

%C a(n+1,m+1), n >= m >= 0, a(n,m) := 0, n<m, has inverse matrix A030528(n,m)*(-1)^(n-m).

%C a(n,k)=number of Dyck paths of semilength n and having k returns to the axis. Also number of Dyck paths of semilength n and having first peak at height k. Also number of ordered trees with n edges and root degree k. Also number of ordered trees with n edges and having the leftmost leaf at level k. Also number of parallelogram polyominoes of semiperimeter n+1 and having k cells in the leftmost column. - _Emeric Deutsch_, Mar 01 2004

%C Triangle T(n,k) with 1<=k<=n given by [0, 1, 1, 1, 1, 1, 1, 1, ...] DELTA [1, 0, 0, 0, 0, 0, 0, 0, ...] = 1; 0, 1; 0, 1, 1; 0, 2, 2, 1; 0, 5, 5, 3, 1; 0, 14, 14, 9, 4, 1; ... where DELTA is the operator defined in A084938; essentially the same triangle as A059365 . - _Philippe Deléham_, Jun 14 2004

%C Number of Dyck paths of semilength and having k-1 peaks at height 2. - _Emeric Deutsch_, Aug 31 2004

%C Riordan array (c(x),x*c(x)), c(x) the g.f. of A000108. Inverse of Riordan array (1-x,x*(1-x)). - _Paul Barry_, Jun 22 2005

%C Subtriangle of triangle A106566 . - _Philippe Deléham_, Jan 07 2007

%C T(n, k) is also the number of order-preserving and order-decreasing full transformations (of an n-chain) with exactly k fixed points. - _Abdullahi Umar_, Oct 02 2008

%C Triangle read by rows, product of A065600 and A007318 considered as infinite lower triangular arrays; A033184 = A065600*A007318. - _Philippe Deléham_, Dec 07 2009

%C The formula stating "Column k is the k-fold convolution of column 1" is equivalent to repeatedly applying M to [1,0,0,0,...], where M is an upper triangular matrix of all 1's with an additional single subdiagonal of 1's. - _Gary W. Adamson_, Jun 06 2011

%C 4^(n-1) = (n-th row terms) dot (first n terms in A001792), where A001792 = binomial transform of the natural numbers: (1, 3, 8, 20, 48, 112, ...). Example: 4^4 = 256 = (14, 14, 9, 4, 1) dot (1, 3, 8, 20, 48) = (42 + 42 + 28 + 14 + 5 + 1) = 256. - _Gary W. Adamson_, Jun 17 2011

%H Reinhard Zumkeller, <a href="/A033184/b033184.txt">Rows n = 1..125 of triangle, flattened</a>

%H José Agapito, Ângela Mestre, Maria M. Torres, and Pasquale Petrullo, <a href="http://cs.uwaterloo.ca/journals/JIS/VOL18/Agapito/agapito2.pdf">On One-Parameter Catalan Arrays</a>, Journal of Integer Sequences, Vol. 18 (2015), Article 15.5.1.

%H M. Aigner, <a href="http://dx.doi.org/10.1016/j.disc.2007.06.012">Enumeration via ballot numbers</a>, Discrete Math., 308 (2008), 2544-2563.

%H J. L. Arregui, <a href="http://arXiv.org/abs/math.NT/0109108">Tangent and Bernoulli numbers related to Motzkin and Catalan numbers by means of numerical triangles</a>, arXiv:math/0109108 [math.NT], 2001.

%H P. Barry, <a href="http://arxiv.org/abs/1107.5490">Invariant number triangles, eigentriangles and Somos-4 sequences</a>, arXiv preprint arXiv:1107.5490 [math.CO], 2011.

%H P. Barry, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL14/Barry1/barry97r2.html">Riordan Arrays, Orthogonal Polynomials as Moments, and Hankel Transforms</a>, J. Int. Seq. 14 (2011) # 11.2.2, example 3.

%H P. Barry, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL14/Barry3/barry132.html">On the Central Coefficients of Bell Matrices</a>, J. Int. Seq. 14 (2011) # 11.4.3 example 6

%H P. Barry, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL15/Barry4/bern2.html">Riordan-Bernstein Polynomials, Hankel Transforms and Somos Sequences</a>, Journal of Integer Sequences, Vol. 15 2012, #12.8.2.

%H P. Barry, <a href="http://arxiv.org/abs/1311.7161">Comparing two matrices of generalized moments defined by continued fraction expansions</a>, arXiv preprint arXiv:1311.7161 [math.CO], 2013 and <a href="https://cs.uwaterloo.ca/journals/JIS/VOL17/Barry3/barry291.html">J. Int. Seq. 17 (2014) # 14.5.1</a>.

%H P. Barry, <a href="http://arxiv.org/abs/1312.0583">Embedding structures associated with Riordan arrays and moment matrices</a>, arXiv preprint arXiv:1312.0583 [math.CO], 2013.

%H P. Barry, A. Hennessy, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL13/Barry5/barry96s.html">Meixner-Type Results for Riordan Arrays and Associated Integer Sequences</a>, J. Int. Seq. 13 (2010) # 10.9.4

%H P. Barry and A. Hennessy, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL15/Barry1/barry202.html">Four-term Recurrences, Orthogonal Polynomials and Riordan Arrays</a>, Journal of Integer Sequences, 2012, article 12.4.2. - From _N. J. A. Sloane_, Sep 21 2012

%H A. Bernini, M. Bouvel and L. Ferrari, <a href="http://puma.dimai.unifi.it/18_3_4/BerniniBouvelFerrari.pdf">Some statistics on permutations avoiding generalized patterns</a>, PU.M.A. Vol. 18 (2007), No. 3-4, pp. 223-237.

%H S. Brlek, E. Duchi, E. Pergola and S. Rinaldi, <a href="http://dx.doi.org/10.1016/j.disc.2004.07.019">On the equivalence problem for succession rules</a>, Discr. Math., 298 (2005), 142-154.

%H D. Callan, <a href="http://arXiv.org/abs/math.CO/0211380">A recursive bijective approach to counting permutations...</a>, arXiv:math/0211380 [math.CO], 2002.

%H N. T. Cameron, <a href="http://www.princeton.edu/~wmassey/NAM03/cameron.pdf">Random walks, trees and extensions of Riordan group techniques</a>

%H Naiomi Cameron, J. E. McLeod, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL19/McLeod/mcleod3.html">Returns and Hills on Generalized Dyck Paths</a>, Journal of Integer Sequences, Vol. 19, 2016, #16.6.1.

%H Gi-Sang Cheon, Hana Kim and Louis W. Shapiro, <a href="http://dx.doi.org/10.1016/j.disc.2012.03.023">Combinatorics of Riordan arrays with identical A and Z sequences</a>, Discrete Math., 312 (2012), 2040-2049.

%H Gi-Sang Cheon, S.-T. Jin, L. W. Shapiro, <a href="http://dx.doi.org/10.1016/j.laa.2015.03.015">A combinatorial equivalence relation for formal power series</a>, Linear Algebra and its Applications, Volume 491, 15 February 2016, Pages 123-137; Proceedings of the 19th ILAS Conference, Seoul, South Korea 2014.

%H E. Deutsch, <a href="http://dx.doi.org/10.1016/S0012-365X(98)00371-9">Dyck path enumeration</a>, Discrete Math., 204, 1999, 167-202.

%H FindStat - Combinatorial Statistic Finder, <a href="http://www.findstat.org/StatisticsDatabase/St000011">The number of touch points of a Dyck path</a>, <a href="http://www.findstat.org/StatisticsDatabase/St000025">The number of initial rises of a Dyck paths</a>, <a href="http://www.findstat.org/StatisticsDatabase/St000061">The number of nodes on the left branch of the tree</a>, <a href="http://www.findstat.org/StatisticsDatabase/St000084">The number of subtrees</a>.

%H Peter M. Higgins, <a href="http://sci-prew.inf.ua/v113/2/S0305004100075964.pdf">Combinatorial results for semigroups of order-preserving mappings</a>, Math. Proc. Camb. Phil. Soc. 113 (1993), 281-296. [From _Abdullahi Umar_, Oct 02 2008]

%H W. Lang, <a href="http://www.cs.uwaterloo.ca/journals/JIS/index.html">On generalizations of Stirling number triangles</a>, J. Integer Seqs., Vol. 3 (2000), #00.2.4.

%H W. Lang, <a href="http://www.fq.math.ca/Scanned/38-5/lang.pdf">On polynomials related to powers of the generating function of Catalan numbers</a>, The Fibonacci Quart. 38 (2000) 408-19.

%H P. J. Larcombe and D. R. French, <a href="https://www.researchgate.net/publication/268866232_The_Catalan_number_k-fold_self-convolution_identity_The_original_formulation">The Catalan number k-fold self-convolution identity: the original formulation</a>, Journal of Combinatorial Mathematics and Combinatorial Computing 46 (2003) 191-204.

%H R. J. Mathar, <a href="http://arxiv.org/abs/1603.00077">Topologically Distinct Sets of Non-intersecting Circles in the Plane</a>, arXiv:1603.00077, 2016.

%H D. Merlini, R. Sprugnoli and M. C. Verri, <a href="http://www.dsi.unifi.it/~merlini/Lucidi.ps">An algebra for proper generating trees</a>

%H J. Noonan and D. Zeilberger, <a href="http://arXiv.org/abs/math.CO/9808080">[math/9808080] The Enumeration of Permutations With a Prescribed Number of ``Forbidden'' Patterns</a>. Also Adv. in Appl. Math. 17 (1996), no. 4, 381--407. MR1422065 (97j:05003).

%H J.-C. Novelli and J.-Y. Thibon, <a href="http://arXiv.org/abs/math.CO/0512570">Noncommutative Symmetric Functions and Lagrange Inversion</a>, arXiv:math/0512570 [math.CO], 2005-2006.

%H R. Pemantle and M. C. Wilson, <a href="http://dx.doi.org/10.1137/050643866">Twenty Combinatorial Examples of Asymptotics Derived from Multivariate Generating Functions, SIAM Rev., 50 (2008), no. 2, 199-272. See p. 264

%H A. Reifegerste, <a href="http://arXiv.org/abs/math.CO/0208006">On the diagram of 132-avoiding permutations</a>, arXiv:math/0208006 [math.CO], 2002.

%H A. Robertson, D. Saracino and D. Zeilberger, <a href="http://arXiv.org/abs/math.CO/0203033">Refined restricted permutations</a>, arXiv:math/0203033 [math.CO], 2002.

%H Yidong Sun and Fei Ma, <a href="http://arxiv.org/abs/1305.2017">Four transformations on the Catalan triangle</a>, arXiv preprint arXiv:1305.2017 [math.CO], 2013.

%H Yidong Sun and Fei Ma, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p33">Some new binomial sums related to the Catalan triangle</a>, Electronic Journal of Combinatorics 21(1) (2014), #P1.33.

%H A. Umar, <a href="http://www.mathnet.ru/adm33">Some combinatorial problems in the theory of symmetric ...</a>, Algebra Disc. Math. 9 (2010) 115-126

%H Sheng-Liang Yang, LJ Wang, <a href="https://ajc.maths.uq.edu.au/pdf/64/ajc_v64_p420.pdf">Taylor expansions for the m-Catalan numbers</a>, Australasian Journal of Combinatorics, Volume 64(3) (2016), Pages 420-431.

%H S.-n. Zheng and S.-l. Yang, <a href="http://dx.doi.org/10.1155/2014/848374">On the-Shifted Central Coefficients of Riordan Matrices</a>, Journal of Applied Mathematics, Volume 2014, Article ID 848374, 8 pages.

%F Column k is the k-fold convolution of column 1. The triangle is also defined recursively by (i) entries outside triangle are 0, (ii) top left entry is 1, (iii) every other entry is sum of its east and northwest neighbor. - _David Callan_, Jul 25 2005

%F G.f.: t*x*c/(1-t*x*c), where c=(1-sqrt(1-4*x))/(2*x) is the g.f. of the Catalan numbers (A000108). - _Emeric Deutsch_, Mar 01 2004

%F T(n+1,k+1) = C(2*n-k, n-k)*(k+1)/(n+1). - _Paul D. Hanna_, Aug 11 2008

%F T((m+1)*n+r-1,m*n+r-1)*r/(m*n+r) = Sum_{k=1..n} (k/n)*T((m+1)*n-k-1,m*n-1)*T(r+k,r), n>=m>1. - _Vladimir Kruchinin_, Mar 17 2011

%F T(n-1,m-1) = (m/n)*Sum_{k=1..n-m+1} (k*A000108(k-1)*T(n-k-1,m-2)), n>=m>1. - _Vladimir Kruchinin_, Mar 17 2011

%F T(n,k) = C(2n-k-1,n-k) - C(2n-k-1,n-k-1). - _Dennis P. Walsh_, Mar 19 2012

%F T(n,k) = C(2n-k,n)*k/(2n-k). - _Dennis P. Walsh_, Mar 19 2012

%F T(n,k) = T(n,k-1) - T(n-1,k-2). - _Dennis P. Walsh_, Mar 19 2012

%F G.f.: 2*x*y / (1 + sqrt(1 - 4*x) - 2*x*y) = Sum_{n >= k > 0} T(n, k) * x^n * y^k. - _Michael Somos_, Jun 06 2016

%e Triangle begins:

%e ---+-----------------------------------

%e n\k| 1 2 3 4 5 6 7

%e ---+-----------------------------------

%e 1 | 1

%e 2 | 1 1

%e 3 | 2 2 1

%e 4 | 5 5 3 1

%e 5 | 14 14 9 4 1

%e 6 | 42 42 28 14 5 1

%e 7 | 132 132 90 48 20 6 1

%p a := proc(n,k) if k<=n then k*binomial(2*n-k,n)/(2*n-k) else 0 fi end: seq(seq(a(n,k),k=1..n),n=1..10);

%t nn = 10; c = (1 - (1 - 4 x)^(1/2))/(2 x); f[list_] := Select[list, # > 0 &]; Map[f, Drop[CoefficientList[Series[y x c/(1 - y x c), {x, 0, nn}], {x, y}],1]] //Flatten (* _Geoffrey Critzer_, Jan 31 2012 *)

%t Flatten[Reverse /@ NestList[Append[Accumulate[#], Last[Accumulate[#]]] &, {1}, 9]] (* _Birkas Gyorgy_, May 19 2012 *)

%o (PARI) T(n,k)=binomial(2*(n-k)+k,n-k)*(k+1)/(n+1) \\ _Paul D. Hanna_, Aug 11 2008

%o (Sage) The simplest way to construct the triangle.

%o def A033184_triangle(n) :

%o T = [0 for i in (0..n)]

%o for k in (1..n) :

%o T[k] = 1

%o for i in range(k-1,0,-1) :

%o T[i] = T[i-1] + T[i+1]

%o print [T[i] for i in (1..k)]

%o A033184_triangle(10) # _Peter Luschny_, Jan 27 2012

%o a033184 n k = a033184_tabl !! (n-1) !! (k-1)

%o a033184_row n = a033184_tabl !! (n-1)

%o a033184_tabl = map reverse a009766_tabl

%o -- _Reinhard Zumkeller_, Feb 19 2014

%o (MAGMA) / As triangle: / [[Binomial(2*n-k,n)*k/(2*n-k): k in [1..n]]: n in [1.. 15]]; // _Vincenzo Librandi_, Oct 12 2015

%Y Rows of Catalan triangle A009766 read backwards.

%Y a(n, 1)= A000108(n-1). Row sums = A000108(n) (Catalan).

%Y The following are all versions of (essentially) the same Catalan triangle: A009766, A030237, A033184, A059365, A099039, A106566, A130020, A047072.

%Y Diagonals give A000108 A000245 A002057 A000344 A003517 A000588 A003518 A003519 A001392, ...

%Y Cf. A116364 (row squared sums). - _Paul D. Hanna_, Aug 11 2008

%K nonn,tabl

%O 1,4

%A _Christian G. Bower_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 23 12:10 EDT 2018. Contains 316527 sequences. (Running on oeis4.)