This site is supported by donations to The OEIS Foundation.



Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000108 Catalan numbers: C(n) = binomial(2n,n)/(n+1) = (2n)!/(n!(n+1)!). Also called Segner numbers.
(Formerly M1459 N0577)
1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, 35357670, 129644790, 477638700, 1767263190, 6564120420, 24466267020, 91482563640, 343059613650, 1289904147324, 4861946401452, 18367353072152, 69533550916004, 263747951750360, 1002242216651368, 3814986502092304 (list; graph; refs; listen; history; text; internal format)



The solution to Schroeder's first problem. A very large number of combinatorial interpretations are known - see references, esp. Stanley, Enumerative Combinatorics, Volume 2. This is probably the longest entry in the OEIS, and rightly so.

Number of ways to insert n pairs of parentheses in a word of n+1 letters. E.g., for n=3 there are 5 ways: ((ab)(cd)), (((ab)c)d), ((a(bc))d), (a((bc)d)), (a(b(cd))).

Consider all the binomial(2n,n) paths on squared paper that (i) start at (0, 0), (ii) end at (2n, 0) and (iii) at each step, either make a (+1,+1) step or a (+1,-1) step. Then the number of such paths that never go below the x-axis (Dyck paths) is C(n). [Chung-Feller]

Number of noncrossing partitions of the n-set. For example, of the 15 set partitions of the 4-set, only [{13},{24}] is crossing, so there are a(4)=14 noncrossing partitions of 4 elements. - Joerg Arndt, Jul 11 2011

a(n-1) is the number of ways of expressing an n-cycle in the symmetric group S_n as a product of n-1 transpositions (u_1,v_1)*(u_2,v_2)*...*(u_{n-1},v_{n-1}) where uk<=uj and vk<=vj for k<j; see example.  If the condition is dropped, one obtains A000272. - Joerg Arndt and Greg Stevenson, Jul 11 2011

a(n) is the number of ordered rooted trees with n nodes, not including the root. See the Conway-Guy reference where these rooted ordered trees are called plane bushes. See also the Bergeron et al. reference, Example 4, p. 167. - Wolfdieter Lang, Aug 07 2007

As shown in the paper from Beineke and Pippert (1971), a(n-2)=D(n) is the number of labeled dissections of a disk, related to the number R(n)=A001761(n-2) of labeled planar 2-trees having n vertices and rooted at a given exterior edge, by the formula D(n)=R(n)/(n-2)!. - M. F. Hasler, Feb 22 2012

Shifts one place left when convolved with itself.

For n >= 1 a(n) is also the number of rooted bicolored unicellular maps of genus 0 on n edges. - Ahmed Fares (ahmedfares(AT)my-deja.com), Aug 15 2001

Ways of joining 2n points on a circle to form n nonintersecting chords. (If no such restriction imposed, then ways of forming n chords is given by (2n-1)!!=(2n)!/n!2^n=A001147(n).)

Arises in Schubert calculus - see Sottile reference.

Inverse Euler transform of sequence is A022553.

With interpolated zeros, the inverse binomial transform of the Motzkin numbers A001006. - Paul Barry, Jul 18 2003

The Hankel transforms of this sequence or of this sequence with the first term omitted give A000012 = 1, 1, 1, 1, 1, 1, ...; example: Det([1, 1, 2, 5; 1, 2, 5, 14; 2, 5, 14, 42; 5, 14, 42, 132]) = 1 and Det([1, 2, 5, 14; 2, 5, 14, 42; 5, 14, 42, 132; 14, 42, 132, 429]) = 1 . - Philippe Deléham, Mar 04 2004

c(n) = C(2*n-2,n-1)/n = (1/n!) * [ n^(n-1) + { C(n-2,1) +C(n-2,2) }*n^(n-2) + { 2*C(n-3,1) +7*C(n-3,2) +8*C(n-3,3) +3*C(n-3,4) }*n^(n-3) + { 6*C(n-4,1) +38*C(n-4,2) +93*C(n-4,3) +111*C(n-4,4) +65*C(n-4,5) +15*C(n-4,6) }*n^(n-4) + ..... ]. - André F. Labossière, Nov 10 2004

Sum_{n=0..infinity} 1/a(n) = 2 + 4*Pi/3^(5/2) = F(1,2;1/2;1/4) = 2.806133050770763... (see L'Univers de Pi link). - Gerald McGarvey and Benoit Cloitre, Feb 13 2005

a(n) equals sum of squares of terms in row n of triangle A053121, which is formed from successive self-convolutions of the Catalan sequence. - Paul D. Hanna, Apr 23 2005

Also coefficients of the Mandelbrot polynomial M iterated an infinite number of times. Examples: M(0) = 0 = 0*c^0 = [0], M(1) = c = c^1 + 0*c^0 = [1 0], M(2) = c^2 + c = c^2 + c^1 + 0*c^0 = [1 1 0], M(3) = (c^2 + c)^2 + c = [0 1 1 2 1], ... ... M(5) = [0 1 1 2 5 14 26 44 69 94 114 116 94 60 28 8 1], ... - Donald D. Cross (cosinekitty(AT)hotmail.com), Feb 04 2005

The multiplicity with which a prime p divides C_n can be determined by first expressing n+1 in base p. For p=2, the multiplicity is the number of 1 digits minus 1. For p an odd prime, count all digits greater than (p+1)/2; also count digits equal to (p+1)/2 unless final; and count digits equal to (p-1)/2 if not final and the next digit is counted. For example, n=62, n+1 = 223_5, so C_62 is not divisible by 5. n=63, n+1 = 224_5, so 5^3 | C_63. - Franklin T. Adams-Watters, Feb 08 2006

Koshy and Salmassi give an elementary proof that the only prime Catalan numbers are a(2) = 2 and a(3) = 5. Is the only semiprime Catalan number a(4) = 14? - Jonathan Vos Post, Mar 06 2006

The answer is yes. Using the formula C_n = C(2n,n)/(n+1), it is immediately clear that C_n can have no prime factor greater than 2n. For n >= 7, C_n > (2n)^2, so it cannot be a semiprime. Given that the Catalan numbers grow exponentially, the above consideration implies that the number of prime divisors of C_n, counted with multiplicity, must grow without limit. The number of distinct prime divisors must also grow without limit, but this is more difficult. Any prime between n+1 and 2n (exclusive) must divide C_n. That the number of such primes grows without limit follows from the prime number theorem. - Franklin T. Adams-Watters, Apr 14 2006

The number of ways to place n indistinguishable balls in n numbered boxes B1,...,Bn such that at most a total of k balls are placed in boxes B1,...,Bk for k=1,...,n. For example, a(3)=5 since there are 5 ways to distribute 3 balls among 3 boxes such that (i) box 1 gets at most 1 ball and (ii) box 1 and box 2 together get at most 2 balls:(O)(O)(O), (O)()(OO), ()(OO)(O), ()(O)(OO), ()()(OOO). - Dennis P. Walsh, Dec 04 2006

a(n) is also the order of the semigroup of order-decreasing and order-preserving full transformations (of an n-element chain) - now known as the Catalan monoid. - Abdullahi Umar, Aug 25 2008

a(n) is the number of trivial representations in the direct product of 2n spinor (the smallest) representations of the group SU(2) (A(1)). - Rutger Boels (boels(AT)nbi.dk), Aug 26 2008

The invert transform appears to converge to the Catalan numbers when applied infinitely many times to any starting sequence. - Mats Granvik, Gary W. Adamson and Roger L. Bagula, Sep 09 2008, Sep 12 2008

lim(a(n)/a(n-1): n->infinity) = 4. - Francesco Antoni (francesco_antoni(AT)yahoo.com), Nov 24 2008

Starting with offset 1 = row sums of triangle A154559. - Gary W. Adamson, Jan 11 2009

C(n) is the degree of the Grassmanian G(1,n+1): the set of lines in (n+1)-dimensional projective space, or the set of planes through the origin in (n+2)-dimensional affine space. The Grassmanian is considered a subset of N-dimensional projective space, N = binomial(n+2,2) - 1. If we choose 2n general (n-1)-planes in projective (n+1)-space, then there are C(n) lines that meet all of them. - Benji Fisher (benji(AT)FisherFam.org), Mar 05 2009

Starting with offset 1 = A068875: (1, 2, 4, 10, 18, 84,...) convolved with Fine numbers, A000957: (1, 0, 1, 2, 6, 18,...). a(6) = 132 = (1, 2, 4, 10, 28, 84) dot (18, 6, 2, 1, 0, 1) = (18 + 12 + 8 + 10 + 0 + 84) = 132. - Gary W. Adamson, May 01 2009

Convolved with A032443: (1, 3, 11, 42, 163,...) = powers of 4, A000302: (1, 4, 16,...). - Gary W. Adamson, May 15 2009

Sum{k=1...Infinity,c(k-1)/2^(2k-1)}=1. The k-th term in the summation is the probability that a random walk on the integers (begining at the origin) will arrive at positive one (for the first time) in exactly (2k-1) steps. - Geoffrey Critzer, Sep 12 2009

C(p+q)-C(p)*C(q)=sum(C(i)*C(j)*C(p+q-i-j-1), i=0..(p-1), j=0..(q-1) ). - Groux Roland, Nov 13 2009

Leonhard Euler used the formula C(n) = product_{i=3..n}(4*i-10)/(i-1) in his 'Betrachtungen, auf wie vielerley Arten ein gegebenes polygonum durch Diagonallinien in triangula zerschnitten werden könne' and computes by recursion C(n+2) for n = 1..8. (Berlin, 4th September 1751, in a letter to Goldbach.) - Peter Luschny, Mar 13 2010

Let A179277 = A(x). Then C(x) is satisfied by A(x)/A(x^2). - Gary W. Adamson, Jul 07 2010

a(n)= A000680(n)/A006472(n). - Mark Dols (markdols99(AT)yahoo.com), Jul 14 2010

a(n) is also the number of quivers in the mutation class of type B_n or of type C_n. - Christian Stump, Nov 02 2010

Consider a set of A000217(n) balls of n colors in which, for each integer k = 1 to n, exactly one color appears in the set a total of k times. (Each ball has exactly one color and is indistinguishable from other balls of the same color.) a(n+1) equals the number of ways to choose 0 or more balls of each color while satisfying the following conditions: 1. No two colors are chosen the same positive number of times. 2. For any two colors (c, d) that are chosen at least once, color c is chosen more times than color d iff color c appears more times in the original set than color d.

If the second requirement is lifted, the number of acceptable ways equals A000110(n+1). See related comments for A016098, A085082. - Matthew Vandermast, Nov 22 2010

Deutsch and Sagan prove the Catalan number C_n is odd if and only if n = 2^a - 1 for some nonnegative integer a. Lin proves for every odd Catalan number C_n, we have C_n == 1 (mod 4). - Jonathan Vos Post, Dec 09 2010

a(n) is the number of functions f:{1,2,...,n}->{1,2,...,n} such that f(1)=1 and for all n>=1 f(n+1)<=f(n)+1. For a nice bijection between this set of functions and the set of length 2n Dyck words, see page 333 of the fxtbook (see link below).

Complement of A092459; A010058(a(n)) = 1. - Reinhard Zumkeller, Mar 29 2011

Postnikov (2005) defines "generalized Catalan numbers" associated with buildings (e.g., Catalan numbers of Type B, see A000984). - N. J. A. Sloane, Dec 10 2011

A076050(a(n)) = n + 1 for n > 0. - Reinhard Zumkeller, Feb 17 2012

Number of permutations in S(n) for which length equals depth. - Bridget Tenner, Feb 22 2012

a(n) is also the number of standard Young tableau of shape (n,n). - Thotsaporn Thanatipanonda, Feb 25 2012

a(n) is the number of binary sequences of length 2n+1 in which the number of ones first exceed the number of zeros at entry 2n+1. See the example below in the example section. - Dennis P. Walsh, Apr 11 2012

a(n+1) = A214292(2*n+1,n) = A214292(2*n+2,n). - Reinhard Zumkeller, Jul 12 2012

Number of binary necklaces of length 2*n+1 containing n 1's (or, by symmetry, 0's). All these are Lyndon words and their representatives (as cyclic maxima) are the binary Dyck words. - Joerg Arndt, Nov 12 1012

Number of sequences consisting of n 'x' letters and n 'y' letters such that (counting from the left) the 'x' count >= 'y' count. For example, for n=3 we have xxxyyy, xxyxyy, xxyyxy, xyxxyy and xyxyxy. - Jon Perry, Nov 16 2012

a(n) is the number of Motzkin paths of length n-1 in which the (1,0)-steps come in 2 colors. Example: a(4)=14 because, denoting U=(1,1), H=(1,0), and D=(1,-1), we have 8 paths of shape HHH, 2 paths of shape UHD, 2 paths of shape UDH, and 2 paths of shape HUD. - José Luis Ramírez Ramírez, Jan 16 2013

If p is an odd prime, then (-1)^((p-1)/2)*a((p-1)/2) mod p = 2. - Gary Detlefs, Feb 20 2013

Conjecture: For any positive integer n, the polynomial sum(k=0..n, a(k)*x^k) is irreducible over the field of rational numbers. - Zhi-Wei Sun, Mar 23 2013

a(n) is the size of the Jones monoid on 2n points (cf. A225798). - James Mitchell, Jul 28 2013

Given Probability (p): sum(n=0..inf) a(n)*(1-p)^n*p^(n+1) = sum(n=1..inf) p^n = p/(1-p). E.g., at p=0.4: 0.4 + 0.6*0.4^2 + 2*0.6^2*0.4^3 + 5*0.6^3*0.4^4 + 14*0.6^4*0.4^5 +... = 0.4 + 0.096 + 0.04608 + 0.027648 + 0.018579456... = 2/3. Since p/(1-p) is itself a probability, it therefore has a maximum value of 1 when p >= 0.5. - Bob Selcoe, Nov 16 2013

No a(n) has the form x^m with m > 1 and x > 1. - Zhi-Wei Sun, Dec 02 2013

From Alexander Adamchuk, Dec 27 2013: (Start)

Prime p divides a((p+1)/2) for p>3. See A120303(n) = Largest prime factor of Catalan number.

Reciprocal Catalan Constant C = 1 + 4*sqrt(3)*Pi/27 = 1.8061330507707... See A121839 = Decimal expansion of sum(k>=1, 1/a(k)).

Log(Phi) = (125*C - 55) / (24*sqrt(5)), where C = Sum_{k>=1} (-1)^(k+1)*1/a(k). See A002390 = Decimal expansion of natural logarithm of golden ratio.

3-d analog of the Catalan numbers: (3n)!/(n!(n+1)!(n+2)!) = A161581(n) = A006480(n) / ((n+1)^2*(n+2)), where A006480(n) = (3n)!/(n!)^3 De Bruijn's S(3,n). (End)

For a relation to the inviscid Burgers', or Hopf, equation, see A001764. - Tom Copeland, Feb 15 2014


The large number of references and links demonstrates the ubiquity of the Catalan numbers.

M. Aigner, Enumeration via ballot numbers, Discrete Math., 308 (2008), 2544-2563.

R. Alter, Some remarks and results on Catalan numbers, pp. 109-132 in Proceedings of the Louisiana Conference on Combinatorics, Graph Theory and Computer Science. Vol. 2, edited R. C. Mullin et al., 1971.

R. Alter and K. K. Kubota, Prime and prime power divisibility of Catalan numbers, J. Combinatorial Theory, Ser. A, 15 (1973), 243-256.

Andrews, George E. Catalan numbers, q-Catalan numbers and hypergeometric series. J. Combin. Theory Ser. A 44 (1987), no. 2, 267--273. MR0879684 (88f:05015)

R. Bacher and C. Krattenthaler, Chromatic statistics for triangulations and FussCatalan complexes, Electronic Journal of Combinatorics, 18 (2011), #P152.

D. F. Bailey, Counting Arrangements of 1's and -1's, Mathematics Magazine 69(2) 128-131 1996.

I. Bajunaid et al., Function series, Catalan numbers and random walks on trees, Amer. Math. Monthly 112 (2005), 765-785.

C. Banderier, M. Bousquet-Mélou, A. Denise, P. Flajolet, D. Gardy and D. Gouyou-Beauchamps, [http://algo.inria.fr/banderier/Papers/DiscMath99.ps Generating Functions for Generating Trees], Discrete Mathematics 246(1-3), March 2002, pp. 29-55.

Barcucci, E.; Del Lungo, A.; Pergola, E.; and Pinzani, R.; Some permutations with forbidden subsequences and their inversion number. Discrete Math. 234 (2001), no. 1-3, 1-15.

E. Barcucci, A. Frosini and S. Rinaldi, On directed-convex polyominoes in a rectangle, Discr. Math., 298 (2005). 62-78.

J.-L. Baril, J.-M. Pallo, Motzkin subposet and Motzkin geodesics in Tamari lattices, 2013; http://jl.baril.u-bourgogne.fr/Motzkin.pdf

F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-like Structures, EMA vol.67, Cambridge, 1998, p. 163, 167, 168, 252, 256, 291.

F. R. Bernhart, Catalan, Motzkin and Riordan numbers, Discr. Math., 204 (1999) 73-112.

A. Bernini, F. Disanto, R. Pinzani and S. Rinaldi, Permutations defining convex permutominoes, J. Int. Seq. 10 (2007) # 07.9.7

M. Bona and B. E. Sagan, On Divisibility of Narayana Numbers by Primes, Journal of Integer Sequences, Vol. 8 (2005), Article 05.2.4.

Bousquet, Michel; and Lamathe, Cedric; On symmetric structures of order two. Discrete Math. Theor. Comput. Sci. 10 (2008), 153-176.

W. G. Brown, Historical note on a recurrent combinatorial problem, Amer. Math. Monthly, 72 (1965), 973-977.

D. Callan, A combinatorial interpretation of a Catalan numbers identity, Math. Mag., 72 (1999), 295-298.

D. Callan, The maximum associativeness of division, Problem 11091, Amer. Math. Monthly, 113 (#5, 2006), 462-463.

D. Callan, Pattern avoidance in "flattened" partitions, Discrete Math., 309 (2009), 4187-4191.

Cameron, Peter J. Some treelike objects. Quart. J. Math. Oxford Ser. (2) 38 (1987), no. 150, 155--183. MR0891613 (89a:05009). See p. 155. - N. J. A. Sloane, Apr 18 2014

Chen, Young-Ming. The Chung-Feller theorem revisited. Discrete Math. 308 (2008), no. 7, 1328--1329. MR2382368 (2008j:05019)

Chung, Kai Lai; Feller, W., On fluctuations in coin-tossing. Proc. Nat. Acad. Sci. U. S. A. 35, (1949). 605-608.

J. Cigler, Some remarks about q-Chebyshev polynomials and q-Catalan numbers and related results, http://homepage.univie.ac.at/Johann.Cigler/preprints/chebyshev-survey.pdf, 2013.

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 53.

J. H. Conway and R. K. Guy, The Book of Numbers, New York: Springer-Verlag, 1995, ch. 4, pp. 96-106.

S. J. Cyvin and I. Gutman, Kekule structures in benzenoid hydrocarbons, Lecture Notes in Chemistry, No. 46, Springer, New York, 1988 (see pp. 183, 196, etc.).

Dairyko, Michael; Tyner, Samantha; Pudwell, Lara; Wynn, Casey. Non-contiguous pattern avoidance in binary trees. Electron. J. Combin. 19 (2012), no. 3, Paper 22, 21 pp. MR2967227. - From N. J. A. Sloane, Feb 01 2013

E. Deutsch, Dyck path enumeration, Discrete Math., 204, 167-202, 1999.

E. Deutsch and L. Shapiro, A survey of the Fine numbers, Discrete Math., 241 (2001), 241-265.

E. Deutsch and L. Shapiro, Seventeen Catalan identities, Bulletin of the Institute of Combinatorics and its Applications, 31, 31-38, 2001.

Doslic, Tomislav and Veljan, Darko. Logarithmic behavior of some combinatorial sequences. Discrete Math. 308 (2008), no. 11, 2182--2212. MR2404544 (2009j:05019)

S. Dulucq and J.-G. Penaud, Cordes, arbres et permutations. Discrete Math. 117 (1993), no. 1-3, 89-105.

A. Errera, Analysis situs - Un problème d'énumération, Mémoires Acad. Bruxelles, Classe des sciences, Série 2, Vol. XI, Fasc. 6, No. 1421 (1931), 26 pp.

Ehrenfeucht, Andrzej; Haemer, Jeffrey; Haussler, David. Quasimonotonic sequences: theory, algorithms and applications. SIAM J. Algebraic Discrete Methods 8 (1987), no. 3, 410--429. MR0897739 (88h:06026)

K. Fan, Structure of a Hecke algebra quotient, J. Amer. Math. Soc., 10 (1997), 139-167.

Susanna Fishel, Myrto Kallipoliti and Eleni Tzanaki, Facets of the Generalized Cluster Complex and Regions in the Extended Catalan Arrangement of Type A, The electronic Journal of Combinatorics 20(4) (2013), #P7.

Flajolet, Philippe; Gourdon, Xavier; and Dumas, Philippe; Mellin transforms and asymptotics: harmonic sums. Special volume on mathematical analysis of algorithms. Theoret. Comput. Sci. 144 (1995), no. 1-2, 3-58.

D. Foata and D. Zeilberger, A classic proof of a recurrence for a very classical sequence, J. Comb Thy A 80 380-384 1997.

H. G. Forder, Some problems in combinatorics, Math. Gazette, vol. 45, 1961, 199-201.

Fürlinger, J.; Hofbauer, J.,  q-Catalan numbers. J. Combin. Theory Ser. A 40 (1985), no. 2, 248--264. MR0814413 (87e:05017)

J. R. Gaggins, Constructing the Centroid of a Polygon, Math. Gaz., 61 (1988), 211-212.

M. Gardner, Time Travel and Other Mathematical Bewilderments, Chap. 20 pp. 253-266, W. H. Freeman NY 1988.

James Gleick, Faster, Vintage Books, NY, 2000 (see pp. 259-261).

Lisa R. Goldberg, Catalan numbers and branched coverings by the Riemann sphere, Adv. Math. 85 (1991), No. 2, 129-144.

H. W. Gould, Research bibliography of two special number sequences, Mathematica Monongaliae, Vol. 12, 1971.

Alain Goupil and Gilles Schaeffer, Factoring N-Cycles and Counting Maps of Given Genus. Europ. J. Combinatorics (1998) 19 819-834.

D. Gouyou-Beauchamps, Chemins sous-diagonaux et tableau de Young, pp. 112-125 of "Combinatoire Enumerative (Montreal 1985)", Lect. Notes Math. 1234, 1986.

M. Griffiths, The Backbone of Pascal's Triangle, United Kingdom Mathematics Trust (2008), 53-63 and 85-93. [From Martin Griffiths (griffm(AT)essex.ac.uk), Mar 28 2009]

J. L. Gross and J. Yellen, eds., Handbook of Graph Theory, CRC Press, 2004; p. 530.

N. S. S. Gu, N. Y. Li and T. Mansour, 2-Binary trees: bijections and related issues, Discr. Math., 308 (2008), 1209-1221.

R. K. Guy and J. L. Selfridge, The nesting and roosting habits of the laddered parenthesis. Amer. Math. Monthly 80 (1973), 868-876.

F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 67, (3.3.23).

Harary, F.; Prins, G.; and Tutte, W. T. The Number of Plane Trees. Indag. Math. 26, 319-327, 1964.

J. Harris, Algebraic Geometry: A First Course (GTM 133), Springer-Verlag, 1992, pages 245-247.

S. Heubach, N. Y. Li and T. Mansour, Staircase tilings and k-Catalan structures, Discrete Math., 308 (2008), 5954-5964.

Higgins, Peter M. Combinatorial results for semigroups of order-preserving mappings. Math. Proc. Camb. Phil. Soc. (1993), 113: 281-296.

B. D. Hughes, Random Walks and Random Environments, Oxford 1995, vol. 1, p. 513, Eq. (7.282).

F. Hurtado, M. Noy, Ears of triangulations and Catalan numbers, Discrete Mathematics, Volume 149, Issues 1-3, Feb 22 1996, Pages 319-324.

M. Janjic, Determinants and Recurrence Sequences, Journal of Integer Sequences, 2012, Article 12.3.5. - From N. J. A. Sloane, Sep 16 2012

R. H. Jeurissen, Raney and Catalan, Discrete Math., 308 (2008), 6298-6307.

M. Kauers and P. Paule, The Concrete Tetrahedron, Springer 2011, p. 36.

Kim, Ki Hang; Rogers, Douglas G.; Roush, Fred W. Similarity relations and semiorders. Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1979), pp. 577--594, Congress. Numer., XXIII-XXIV, Utilitas Math., Winnipeg, Man., 1979. MR0561081 (81i:05013)

Klarner, D. A. A Correspondence Between Sets of Trees. Indag. Math. 31, 292-296, 1969.

M. Klazar, On numbers of Davenport-Schinzel sequences, Discr. Math., 185 (1998), 77-87.

D. E. Knuth, The Art of Computer Programming, vol. 4A, Combinatorial Algorithms, Section (p. 450).

Thomas Koshy and Mohammad Salmassi, "Parity and Primality of Catalan Numbers", College Mathematics Journal, Vol. 37, No. 1 (Jan 2006), pp. 52-53.

M. Kosters, A theory of hexaflexagons, Nieuw Archief Wisk., 17 (1999), 349-362.

Kreweras, G. Sur les partitions non croisees d'un cycle. (French) Discrete Math. 1 (1972), no. 4, 333--350. MR0309747 (46 #8852)

Laradji, A. and Umar, A. On certain finite semigroups of order-decreasing transformations I, Semigroup Forum 69 (2004), 184-200.

P. J. Larcombe, On pre-Catalan Catalan numbers: Kotelnikow (1766), Mathematics Today, 35 (1999), p. 25.

P. J. Larcombe, On the history of the Catalan numbers: a first record in China, Mathematics Today, 35 (1999), p. 89.

P. J. Larcombe, The 18th century Chinese discovery of the Catalan numbers, Math. Spectrum, 32 (1999/2000), 5-7.

P. J. Larcombe and P. D. C. Wilson, On the trail of the Catalan sequence, Mathematics Today, 34 (1998), 114-117.

P. J. Larcombe and P. D. C. Wilson, On the generating function of the Catalan sequence: a historical perspective, Congress. Numer., 149 (2001), 97-108.

G. S. Lueker, Some techniques for solving recurrences, Computing Surveys, 12 (1980), 419-436.

J. J. Luo, Antu Ming, the first inventor of Catalan numbers in the world [in Chinese], Neimenggu Daxue Xuebao, 19 (1998), 239-245.

Mansour, Toufik; Schork, Matthias; Shattuck, Mark. Catalan numbers and pattern restricted set partitions. Discrete Math. 312(2012), no. 20, 2979--2991. MR2956089 - From N. J. A. Sloane, Sep 07 2012

Toufik Mansour and Simone Severini, Enumeration of (k,2)-noncrossing partitions, Discrete Math., 308 (2008), 4570-4577.

Mays, M. E.; and Wojciechowski, Jerzy; A determinant property of Catalan numbers. Discrete Math. 211, No. 1-3, 125-133 (2000). Zbl 0945.05037

D. Merlini, R. Sprugnoli and M. C. Verri, The tennis ball problem, J. Combin. Theory, A 99 (2002), 307-344.

A. Milicevic and N. Trinajstic, "Combinatorial Enumeration in Chemistry", Chem. Modell., Vol. 4, (2006), pp. 405-469.

Sam Miner and I. Pak, The shape of random pattern avoiding permutations, http://www.math.ucla.edu/~pak/papers/PermShape7.pdf, 2013.

R. J. Nowakowski, G. Renault, E. Lamoureux, S. Mellon and T. Miller, The Game of timber!, http://www.labri.fr/perso/grenault/NRLMM.pdf, 2013. - From N. J. A. Sloane, Feb 11 2013

C. O. Oakley and R. J. Wisner, Flexagons, Amer. Math. Monthly, 64 (1957), 143-154.

A. Panholzer and H. Prodinger, Bijections for ternary trees and non-crossing trees, Discrete Math., 250 (2002), 181-195 (see Eq. 4).

S. G. Penrice, Stacks, bracketings and CG-arrangements, Math. Mag., 72 (1999), 321-324.

C. A. Pickover, Wonders of Numbers, Chap. 71, Oxford Univ. Press NY 2000.

Clifford A. Pickover, A Passion for Mathematics, Wiley, 2005; see p. 71.

Pólya, G. On the number of certain lattice polygons. J. Combinatorial Theory 6 1969 102--105. MR0236031 (38 #4329)

Jocelyn Quaintance and Harris Kwong, A combinatorial interpretation of the Catalan and Bell number difference tables, Integers, 13 (2013), #A29.

R. Read, "Counting Binary Trees" in 'The Mathematical Gardner', D. A. Klarner Ed. pp. 331-334, Wadsworth CA 1989.

J.-L. Remy, Un procede iteratif de denombrement d'arbres binaires et son application a leur generation aleatoire, RAIRO Inform. Theor. 19 (1985), 179-195.

J. Riordan, Combinatorial Identities, Wiley, 1968, p. 101.

J. Riordan, The distribution of crossings of chords joining pairs of 2n points on a circle, Math. Comp., 29 (1975), 215-222.

T. Santiago Costa Oliveira, "Catalan traffic" and integrals on the Grassmannian of lines, Discr. Math., 308 (2007), 148-152.

A. Sapounakis, I. Tasoulas and P. Tsikouras, Counting strings in Dyck paths, Discrete Math., 307 (2007), 2909-2924.

E. Schroeder, Vier combinatorische Probleme, Z. f. Math. Phys., 15 (1870), 361-376.

Sarah Shader, Weighted Catalan Numbers and Their Divisibility Properties, Research Science Institute, MIT, 2014; http://math.mit.edu/news/summer/RSIPapers/2013Shader.pdf

Shapiro, Louis W. Catalan numbers and "total information" numbers. Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1975), pp. 531--539. Congressus Numerantium, No. XIV, Utilitas Math., Winnipeg, Man., 1975. MR0398853 (53 #2704).

L. W. Shapiro, A short proof of an identity of Touchard's concerning Catalan numbers, J. Combin. Theory, A 20 (1976), 375-376.

L. W. Shapiro and C. J. Wang, Generating identities via 2 X 2 matrices, Congressus Numerantium, 205 (2010), 33-46.

L. W. Shapiro, W.-J. Woan and S. Getu, The Catalan numbers via the World Series, Math. Mag., 66 (1993), 20-22.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

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

Solomon, A. Catalan monoids, monoids of local endomorphisms and their presentations. Semigroup Forum 53 (1996), 351-368.

R. P. Stanley, Enumerative Combinatorics, Wadsworth, Vol. 1, 1986, Vol. 2, 1999; see especially Chapter 6.

R. P. Stanley, Recent Progress in Algebraic Combinatorics, Bull. Amer. Math. Soc., 40 (2003), 55-68.

P. Tarau, Computing with Catalan Families, 2013, http://logic.cse.unt.edu/tarau/research/2013/catco.pdf

J. A. von Segner, Enumeratio modorum, quibus figurae planae rectilineae per diagonales dividuntur in triangula, Novi Comm. Acad. Scient. Imper. Petropolitanae, 7 (1758/1759), 203-209.

I. Vun and P. Belcher, Catalan numbers, Mathematical Spectrum, 30 (1997/1998), 3-5.

David W. Walkup, The number of plane trees, Mathematika 19 (1972), 200-204.

D. Wells, Penguin Dictionary of Curious and Interesting Numbers, Entry 42 p 121, Penguin Books, 1987.


Neil J. A. Sloane, K. D. Bajpai and Robert G. Wilson v, Table of n, a(n) for n = 0..1000 (first 200 terms from Neil J. A. Sloane and the first 351 from K. D. Bajpai)

James Abello, The weak Bruhat order of S consistent sets, and Catalan numbers, SIAM J. Discrete Math. 4 (1991), 1-16.

N. Alon, Y. Caro and I. Krasikov, Bisection of trees and sequences, Discrete Math., 114 (1993), 3-7. (See Lemma 2.1.)

Joerg Arndt, Fxtbook, p. 333 and p. 337.

Jean-Christophe Aval, Multivariate Fuss-Catalan numbers, arXiv:0711.0906v1, Discrete Math., 308 (2008), 4660-4669.

M. Azaola and F. Santos, The number of triangulations of the cyclic polytope C(n,n-4), Discrete Comput. Geom., 27 (2002), 29-48. (C(n) = number of triangulations of cyclic polytope C(n,2).)

John Baez, This week's finds in mathematical physics, Week 202

E. Barcucci, A. Del Lungo, E. Pergola and R. Pinzani, Permutations avoiding an increasing number of length-increasing forbidden subsequences, Discrete Mathematics and Theoretical Computer Science 4, 2000, 31-44.

J.-L. Baril, Classical sequences revisited with permutations avoiding dotted pattern, Electronic Journal of Combinatorics, 18 (2011), #P178.

Paul Barry, A Catalan Transform and Related Transformations on Integer Sequences, Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.5.

Paul Barry, On Integer-Sequence-Based Constructions of Generalized Pascal Triangles, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.4.

Paul Barry, Invariant number triangles, eigentriangles and Somos-4 sequences, arXiv:1107.5490, 2011.

Matthew Bennett, Vyjayanthi Chari, R. J. Dolbin and Nathan Manning, Square partitions and Catalan numbers, arXiv:0912.4983.

M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210.

L. W. Beineke and R. E. Pippert, Enumerating labeled k-dimensional trees and ball dissections, pp. 12-26 of Proceedings of Second Chapel Hill Conference on Combinatorial Mathematics and its Applications, University of North Carolina, Chapel Hill, 1970. Reprinted in Math. Annalen 191 (1971), 87-98.

D. Bill, Durango Bill's Enumeration of Binary Trees

Miklós Bóna, Surprising Symmetries in Objects Counted by Catalan Numbers, Electronic J. Combin., 19 (2012), P62.

H. Bottomley, Catalan Space Invaders

H. Bottomley, Illustration for A000108, A001147, A002694, A067310 and A067311

T. Bourgeron, Montagnards et polygones

M. Bousquet-Mélou and Gilles Schaeffer, Walks on the slit plane, Probability Theory and Related Fields, Vol. 124, no. 3 (2002), 305-344.

G. Bowlin and M. G. Brin, Coloring Planar Graphs via Colored Paths in the Associahedra, arXiv preprint arXiv:1301.3984, 2013. - From N. J. A. Sloane, Feb 12 2013

Douglas Bowman and Alon Regev, Counting symmetry classes of dissections of a convex regular polygon, arXiv preprint arXiv:1209.6270, 2012.

K. S. Brown's Mathpages, The Meanings of Catalan Numbers [Broken link]

B. Bukh, PlanetMath.org, Catalan numbers

Alexander Burstein, Sergi Elizalde and Toufik Mansour, Restricted Dumont permutations, Dyck paths and noncrossing partitions, arXiv math.CO/0610234.

David Callan, A Combinatorial Interpretation for a Super-Catalan Recurrence, Journal of Integer Sequences, Vol. 8 (2005), Article 05.1.8.

David Callan, A Combinatorial Interpretation of the Eigensequence for Composition, Journal of Integer Sequences, Vol. 9 (2006), Article 06.1.4.

D. Callan, A variant of Touchard's Catalan number identity, Arxiv preprint arXiv:1204.5704, 2012. - From N. J. A. Sloane, Oct 10 2012

David Callan and Emeric Deutsch, The Run Transform,  Discrete Math. 312 (2012), no. 19, 2927-2937, arXiv:1112.3639, 2011

N. T. Cameron, Random walks, trees and extensions of Riordan group techniques

Naiomi T. Cameron and Asamoah Nkwanta, On Some (Pseudo) Involutions in the Riordan Group, Journal of Integer Sequences, Vol. 8 (2005), Article 05.3.7.

P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.

F. Cazals, Combinatorics of Non-Crossing Configurations, Studies in Automatic Combinatorics, Volume II (1997).

Julie Christophe, Jean-Paul Doignon and Samuel Fiorini, Counting Biorders, J. Integer Seqs., Vol. 6, 2003.

J. Cigler, Some nice Hankel determinants, arXiv:1109.1449, 2011.

T. Davis, Catalan Numbers

E. Deutsch and B. E. Sagan, Congruences for Catalan and Motzkin numbers and related sequences, J. Num. Theory 117 (2006), 191-215.

R. M. Dickau, Catalan numbers (another copy)

T. Dokos, I. Pak, The expected shape of random doubly alternating Baxter permutations, arXiv:1401.0770, 2014.

Luca Ferrari and Emanuele Munarini, Enumeration of edges in some lattices of paths, Arxiv preprint arXiv:1203.6792, 2012. - From N. J. A. Sloane, Oct 03 2012

D. Foata, G-N. Han, The doubloon polynomial triangle, Ram. J. 23 (2010), 107-126

Dominique Foata and Guo-Niu Han, Doubloons and new q-tangent numbers, Quart. J. Math. 62 (2) (2011) 417-432

Philippe Flajolet, Eric Fusy, Xavier Gourdon, Daniel Panario and Nicolas Pouyanne, A hybrid of Darboux's method and singularity analysis in combinatorial asymptotics, arXiv:math.CO/0606370

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009; see page 18, 35

D. Foata and D. Zeilberger, A classic proof of a recurrence for a very classical sequence

S. Forcey, M. Kafashan, M. Maleki and M. Strayer, Recursive bijections for Catalan objects, arXiv preprint arXiv:1212.1188, 2012. - From N. J. A. Sloane, Jan 03 2013

I. Galkin, Enumeration of the Binary Trees(Catalan Numbers)

Mohammad GANJTABESH, Armin MORABBI and Jean-Marc STEYAERT, Enumerating the number of RNA structures

E.-K. Ghang and D. Zeilberger, Zeroless Arithmetic: Representing Integers ONLY using ONE, arXiv preprint arXiv:1303.0885, 2013

A. Ghasemi, K. Sreenivas, L. K. Taylor, Numerical Stability and Catalan Numbers, arXiv preprint arXiv:1309.4820, 2013

Lisa R. Goldberg, Catalan numbers and branched coverings by the Riemann sphere, Adv. Math. 85 (1991), No. 2, 129-144.

K. Gorska and K. A. Penson, Multidimensional Catalan and related numbers as Hausdorff moments, arXiv preprint arXiv:1304.6008, 2013

H. W. Gould, Congr. Numer. 165 (2003) p 33-38.

B. Gourevitch, L'univers de Pi (click Mathematiciens, Gosper)

Mats Granvik, Catalan numbers as convergents of power series

H. G. Grundman and E. A. Teeple, Sequences of Generalized Happy Numbers with Small Bases, Journal of Integer Sequences, Vol. 10 (2007), Article 07.1.8.

R. K. Guy, Catwalks, Sandsteps and Pascal Pyramids, J. Integer Seqs., Vol. 3 (2000), #00.1.6

R. K. Guy and J. L. Selfridge, The nesting and roosting habits of the laddered parenthesis (annotated cached copy)

Guo-Niu Han, Enumeration of Standard Puzzles

Guo-Niu Han, Enumeration of Standard Puzzles [Cached copy]

A. M. Hinz, S. Klavžar, U. Milutinović, C. Petr, The Tower of Hanoi - Myths and Maths, Birkhäuser 2013. See page 259. Book's website

Aoife Hennessy, A Study of Riordan Arrays with Applications to Continued Fractions, Orthogonal Polynomials and Lattice Paths, Ph. D. Thesis, Waterford Institute of Technology, Oct. 2011

V. E. Hoggatt, Jr., and Paul S. Bruckman, The H-convolution transform, Fibonacci Quart., Vol. 13(4), 1975, p. 357.

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 48

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 52

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 71

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 76

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 284

I. Jensen, Series exapansions for self-avoiding polygons

S. Johnson, The Catalan Numbers

A. Karttunen, Illustration of initial terms up to size n=7

C. Kimberling, Matrix Transformations of Integer Sequences, J. Integer Seqs., Vol. 6, 2003.

Nate Kube and Frank Ruskey, Sequences That Satisfy a(n-a(n))=0, Journal of Integer Sequences, Vol. 8 (2005), Article 05.5.5.

W. Lang, On generalizations of Stirling number triangles, J. Integer Seqs., Vol. 3 (2000), #00.2.4.

J. W. Layman, The Hankel Transform and Some of its Properties, J. Integer Sequences, 4 (2001), #01.1.5.

Pierre Lescanne, An exercise on streams: convergence acceleration, arXiv preprint arXiv:1312.4917, 2013

Hsueh-Yung Lin, The odd Catalan numbers modulo 2^k, Dec 08 2010.

Peter Luschny, The Lost Catalan Numbers And The Schröder Tableaux

Sara Madariaga, Gröbner-Shirshov bases for the non-symmetric operads of dendriform algebras and quadri-algebras, arXiv:1304.5184, 2013

Colin L. Mallows and Lou Shapiro, Balls on the Lawn, J. Integer Sequences, Vol. 2, 1999, #5.

Toufik Mansour, Counting Peaks at Height k in a Dyck Path, Journal of Integer Sequences, Vol. 5 (2002), Article 02.1.1

Toufik Mansour, Statistics on Dyck Paths, Journal of Integer Sequences, Vol. 9 (2006), Article 06.1.5.

Toufik Mansour and Yidong Sun, Identities involving Narayana polynomials and Catalan numbers (2008), arXiv:0805.1274; Discrete Mathematics, Volume 309, Issue 12, Jun 28 2009, Pages 4079-4088

Toufik Mansour and Mark Shattuck, Counting Dyck Paths According to the Maximum Distance Between Peaks and Valleys, Journal of Integer Sequences, Vol. 15 (2012), #12.1.1.

R. J. Marsh and P. P. Martin, Pascal arrays: counting Catalan sets

Math Forum Discussions, The Meanings of Catalan Numbers

D. Merlini, R. Sprugnoli and M. C. Verri, Waiting patterns for a printer, FUN with algorithm'01, Isola d'Elba, 2001.

Marni Mishna and Lily Yen, Set partitions with no k-nesting, arXiv:1106.5036, 2011

Torsten Muetze and Franziska Weber, Construction of 2-factors in the middle layer of the discrete cube, Arxiv preprint arXiv:1111.2413, 2011

Liviu I. Nicolaescu, Counting Morse functions on the 2-sphere, arXiv:math/0512496.

J.-C. Novelli and J.-Y. Thibon, Free quasi-symmetric functions of arbitrary level

Igor Pak, Catalan Numbers Page

Igor Pak, Who Named the Catalan Numbers?

A. Panayotopoulos and P. Tsikouras, Meanders and Motzkin Words, J. Integer Seqs., Vol. 7, 2004.

A. Panholzer and H. Prodinger, Bijections for ternary trees and non-crossing trees, Discrete Math., 250 (2002), 181-195 (see Eq. 4).

Robert Parviainen, Lattice Path Enumeration of Permutations with k Occurrences of the Pattern 2-13, Journal of Integer Sequences, Vol. 9 (2006), Article 06.3.2.

P. Peart and W.-J. Woan, Generating Functions via Hankel and Stieltjes Matrices, J. Integer Seqs., Vol. 3 (2000), #00.2.1.

P. Peart and W.-J. Woan, Dyck Paths With No Peaks at Height k, J. Integer Sequences, 4 (2001), #01.1.3.

K. A. Penson and J.-M. Sixdeniers, Integral Representations of Catalan and Related Numbers, J. Integer Sequences, 4 (2001), #01.2.5.

Karol A. Penson and Karol Zyczkowski, Product of Ginibre matrices : Fuss-Catalan and Raney distribution, arXiv version; Phys. Rev E. vol. 83, 061118 (2011).

T. K. Petersen and Bridget Eileen Tenner, The depth of a permutation, arXiv:1202.4765.

Alexander Postnikov, Permutohedra, associahedra, and beyond, 2005, arXiv:math/0507163.

Alon Regev, Enumerating Triangulations by Parallel Diagonals, Journal of Integer Sequences, Vol. 15 (2012), #12.8.5; Arxiv preprint arXiv:1208.3915, 2012.

E. Rowland, R. Yassawi, Automatic congruences for diagonals of rational functions, arXiv preprint arXiv:1310.8635, 2013

E. Rowland, D. Zeilberger, A Case Study in Meta-AUTOMATION: AUTOMATIC Generation of Congruence AUTOMATA For Combinatorial Sequences, arXiv preprint arXiv:1311.4776, 2013

A. Sapounakis and P. Tsikouras, On k-colored Motzkin words, Journal of Integer Sequences, Vol. 7 (2004), Article 04.2.5.

A. Sapounakis, I. Tasoulas and P. Tsikouras, On the Dominance Partial Ordering of Dyck Paths, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.5.

A. Schuetz and G. Whieldon, Polygonal Dissections and Reversions of Series, arXiv preprint arXiv:1401.7194, 2014

Michael Z. Spivey and Laura L. Steil, The k-Binomial Transforms and the Hankel Transform, Journal of Integer Sequences, Vol. 9 (2006), Article 06.1.1.

N. J. A. Sloane, Illustration of initial terms

Frank Sottile, The Schubert Calculus of Lines (a section of Enumerative Real Algebraic Geometry)

R. P. Stanley, Hipparchus, Plutarch, Schr"oder and Hough, Am. Math. Monthly, Vol. 104, No. 4, p. 344, 1997.

R. P. Stanley, Exercises on Catalan and Related Numbers

R. P. Stanley, Catalan Addendum

Zhi-Wei Sun, A combinatorial identity with application to Catalan numbers, arXiv:math.CO/0509648

Zhi-Wei Sun and Roberto Tauraso, On some new congruences for binomial coefficients, arXiv:0709.1665.

V. S. Sunder, Catalan numbers

D. Taylor, Catalan Structures(up to C(7))

A. Vieru, Agoh's conjecture: its proof, its generalizations, its analogues, arXiv:1107.2938, 2011.

Gérard Villemin, Nombres De Catalan (French)

Eric Weisstein's World of Mathematics, Catalan Number, Binary Bracketing, Binary Tree, Nonassociative Product, Staircase Walk, Dyck Path

J. Winter, M. M. Bonsangue and J. J. M. M. Rutten, Context-free coalgebras, 2013

Roman Witula, Damian Slota and Edyta Hetmaniok, Bridges between different known integer sequences, Annales Mathematicae et Informaticae, 41 (2013) pp. 255-263.

W.-J. Woan, Hankel Matrices and Lattice Paths, J. Integer Sequences, 4 (2001), #01.1.2.

Wen-jin Woan, A Recursive Relation for Weighted Motzkin Sequences Journal of Integer Sequences, Vol. 8 (2005), Article 05.1.6.

Wen-jin Woan, Animals and 2-Motzkin Paths, Journal of Integer Sequences, Vol. 8 (2005), Article 05.5.6.

Wen-jin Woan, A Relation Between Restricted and Unrestricted Weighted Motzkin Paths, Journal of Integer Sequences, Vol. 9 (2006), Article 06.1.7.

F. Yano and H. Yoshida, Some set partition statistics in non-crossing partitions and generating functions, Discr. Math., 307 (2007), 3147-3160.

Index entries for "core" sequences

Index entries for sequences related to rooted trees

Index entries for sequences related to parenthesizing

Index entries for sequences related to necklaces


a(n)) = A000984(n)/(n+1) = binomial(2*n, n)/(n+1) = (2*n)!/(n!*(n+1)!).

a(n) = binomial(2*n, n)-binomial(2*n, n-1).

a(n) = Sum_{k=0..n-1} a(k)a(n-1-k).

a(n) = Prod_{k=2..n} (1 + n/k), if n>1.

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

a(n+1) = Sum_{i} binomial(n, 2*i)*2^(n-2*i)*a(i). - Touchard

2*(2*n-1)*a(n-1) = (n+1)*a(n).

It is known that a(n) is odd if and only if n=2^k-1, k=1, 2, 3, ... - Emeric Deutsch, Aug 04 2002

Using the Stirling approximation in A000142 we get the asymptotic expansion a(n) ~ 4^n / (sqrt(Pi * n) * (n + 1)). - Dan Fux (dan.fux(AT)OpenGaia.com or danfux(AT)OpenGaia.com), Apr 13 2001

Integral representation: a(n)=int(x^n*sqrt((4-x)/x), x=0..4)/(2*Pi). - Karol A. Penson, Apr 12 2001

E.g.f.: exp(2*x)*(I_0(2*x)-I_1(2*x)), where I_n is Bessel function. - Karol A. Penson, Oct 07 2001

Polygorial(n, 6)/Polygorial(n, 3). - Daniel Dockery (peritus(AT)gmail.com), Jun 24 2003

G.f. A(x) satisfies ((A(x) + A(-x)) / 2)^2 = A(4*x^2). - Michael Somos, Jun 27, 2003

G.f. A(x) satisfies Sum_{k>=1} k(A(x)-1)^k = Sum_{n >= 1} 4^{n-1}*x^n. - Shapiro, Woan, Getu

a(n+m) = Sum_{k} A039599(n, k)*A039599(m, k). - Philippe Deléham, Dec 22 2003

a(n+1) = (1/(n+1))*sum_{k=0..n} a(n-k)*binomial(2k+1, k+1). - Philippe Deléham, Jan 24 2004

a(n) = Sum_{k>=0} A008313(n, k)^2. - Philippe Deléham, Feb 14 2004

a(m+n+1) = Sum_{k>=0} A039598(m, k)*A039598(n, k). - Philippe Deléham, Feb 15 2004

a(n)=sum{k=0..n, (-1)^k*2^(n-k)*binomial(n, k)*binomial(k, floor(k/2))}. - Paul Barry, Jan 27 2005

a(n) = Sum_{k=0..[n/2]} ((n-2*k+1)*C(n, n-k)/(n-k+1))^2, which is equivalent to: a(n) = Sum_{k=0..n} A053121(n, k)^2, for n>=0. - Paul D. Hanna, Apr 23 2005

a((m+n)/2) = Sum_{k>=0} A053121(m, k)*A053121(n, k) if m+n is even. - Philippe Deléham, May 26 2005

E.g.f. Sum_{n>=0} a(n) * x^(2*n) / (2*n)! = BesselI(1, 2*x) / x. - Michael Somos, Jun 22 2005

Given g.f. A(x), then B(x) = x * A(x^3) satisfies 0 = f(x, B(X)) where f(u, v) = u - v + (u*v)^2 or B(x) = x + (x * B(x))^2 which implies B(-B(x)) = -x and also (1 + B^3) / B^2 = (1 - x^3) / x^2. - Michael Somos, Jun 27 2005

a(n) = a(n-1)*(4-6/(n+1)). a(n) = 2a(n-1)*(8a(n-2)+a(n-1))/(10a(n-2)-a(n-1)). - Franklin T. Adams-Watters, Feb 08 2006

Sum_{k=1}^{infinity} a(k)/4^k = 1. - Franklin T. Adams-Watters, Jun 28 2006

a(n) = A047996(2*n+1,n). - Philippe Deléham, Jul 25 2006

Binomial transform of A005043. - Philippe Deléham, Oct 20 2006

a(n)=Sum_{k, 0<=k<=n}(-1)^k*A116395(n,k). - Philippe Deléham, Nov 07 2006

a(n)=[1/(s-n)]*sum_{k=0..n} (-1)^k (k+s-n)*binomial(s-n,k)*binomial(s+n-k,s) with s a nonnegative free integer [H. W. Gould].

a(k) = Sum_{i=1..k} |A008276(i,k)| * (k-1)^(k-i) / k!. - André F. Labossière, May 29 2007

a(n)=Sum_{k, 0<=k<=n}A129818(n,k)*A007852(k+1). - Philippe Deléham, Jun 20 2007

a(n)=Sum_{k, 0<=k<=n}A109466(n,k)*A127632(k). - Philippe Deléham, Jun 20 2007

Row sums of triangle A124926. - Gary W. Adamson, Oct 22 2007 lim(1+Sum(a(k)/A004171(k): 0<=k<=n): n->infinity) = 4/Pi. - Reinhard Zumkeller, Aug 26 2008

a(n)=Sum_{k, 0<=k<=n}A120730(n,k)^2 and a(k+1)=Sum_{n, n>=k}A120730(n,k). - Philippe Deléham, Oct 18 2008

Given an integer t >= 1 and initial values u = [a_0, a_1, ..., a_{t-1}], we may define an infinite sequence Phi(u) by setting a_n = a_{n-1} + a_0*a_{n-1} + a_1*a_{n-2} + ... + a_{n-2}*a_1 for n >= t. For example, the present sequence is Phi([1]) (also Phi([1,1])). - Gary W. Adamson, Oct 27 2008

a(n) = sum_{l_1=0}^{n+1} sum_{l_2=0}^{n}...sum_{l_i=0}^{n-i}...sum_{l_n=0}^{1} delta(l_1,l_2,...,l_i,...,l_n) where delta(l_1,l_2,...,l_i,...,l_n) = 0 if any l_i < l_(i+1) and l_(i+1) <> 0 for i=1..n-1 and delta(l_1,l_2,...,l_i,...,l_n) = 1 otherwise. - Thomas Wieder, Feb 25 2009

Let A(x) be the g.f., then B(x)=x*A(x) satisfies the differential equation B'(x)-2*B'(x)*B(x)-1=0. - Vladimir Kruchinin, Jan 18 2011

G.f.: 1/(1-x/(1-x/(1-x/(...)))) (continued fraction). - Joerg Arndt, Mar 18 2011

With F(x) = (1-2*x-sqrt(1-4*x))/(2*x) an o.g.f. in x for the Catalan series, G(x)= x/(1+x)^2 is the compositional inverse of F (nulling the n=0 term). - Tom Copeland, Sep 04 2011

With H(x) = 1/(dG(x)/dx) = (1+x)^3 / (1-x), the n-th Catalan number is given by (1/n!)*((H(x)*d/dx)^n)x evaluated at x=0, i.e., F(x) = exp(x*H(u)*d/du)u, evaluated at u = 0. Also, dF(x)/dx = H(F(x)), and H(x) is the o.g.f. for A115291. - Tom Copeland, Sep 04 2011

With F(x)={1-sqrt[1-4*x]}/2 an o.g.f. in x for the Catalan series, G(x)= x*(1-x) is the compositional inverse and this relates the Catalan numbers to the row sums of A125181. - Tom Copeland, Sep 30 2011

With H(x)=1/(dG(x)/dx)= 1/(1-2x), the n-th Catalan number (offset 1) is given by (1/n!)*((H(x)*d/dx)^n)x evaluated at x=0, i.e., F(x) = exp(x*H(u)*d/du)u, evaluated at u = 0. Also, dF(x)/dx = H(F(x)). - Tom Copeland, Sep 30 2011

G.f.: (1-sqrt(1-4*x))/(2*x)=G(0) where G(k)=1+(4*k+1)*x/(k+1-2*x*(k+1)*(4*k+3)/(2*x*(4*k+3)+(2*k+3)/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, Nov 30 2011

E.g.f.: exp(2*x)*(BesselI(0,2*x)-BesselI(1,2*x))=G(0) where G(k)=1+(4*k+1)*x/((k+1)*(2*k+1)-x*(k+1)*(2*k+1)*(4*k+3)/(x*(4*k+3)+(k+1)*(2*k+3)/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, Nov 30 2011

E.g.f.: Hypergeometric([1/2],[2],4*x) which coincides with the e.g.f. given just above, and also by Karol A. Penson further above. - Wolfdieter Lang, Jan 13 2012

a(n) = A208355(2*n-1) = A208355(2*n) for n > 0. - Reinhard Zumkeller, Mar 04 2012

G.f.: 1 + 2*x/(U(0)-2*x) where U(k)= k*(4*x+1) + 2*x + 2 - x*(2*k+3)*(2*k+4)/U(k+1); (continued fraction, Euler's 1st kind, 1-step). - Sergei N. Gladkovskii, Sep 20 2012

G.f.: hypergeom([1/2,1],[2],4*x). - Joerg Arndt, Apr 06 2013

Special values of Jacobi polynomials, in Maple notation: a(n) = 4^n*JacobiP(n,1,-1/2-n,-1)/(n+1). - Karol A. Penson, Jul 28 2013

For n > 0: a(n) = sum of row n in triangle A001263. - Reinhard Zumkeller, Oct 10 2013

a(n) = binomial(2n,n-1)/n and a(n) mod n = binomial(2n,n) mod n = A059288(n). - Jonathan Sondow, Dec 14 2013

a(n-1) = sum(t1+2*t2+...+n*tn=n, (-1)^(1+t1+t2+...+tn)*multinomial(t1+t2 +...+tn,t1,t2,...,tn)*a(1)^t1*a(2)^t2*...*a(n)^tn). - Mircea Merca, Feb 27 2014

a(n) = sum_{k=1..n} binomial(n+k-1,n)/n if n>0. Alexander Adamchuk, Mar 25 2014


The following products of 3 transpositions lead to a 4-cycle in S_4:





(1,4)*(2,4)*(3,4). - Joerg Arndt and Greg Stevenson, Jul 11 2011

For n=3, a(3)=5 since there are exactly 5 binary sequences of length 7 in which the number of ones first exceed the number of zeros at entry 7, namely, 0001111, 0010111, 0011011, 0100111, and 0101011. - Dennis P. Walsh, Apr 11 2012

G.f. = 1 + x + 2*x^2 + 5*x^3 + 14*x^4 + 42*x^5 + 132*x^6 + 429*x^7 + ...


A000108 := n->binomial(2*n, n)/(n+1); G000108 := (1 - sqrt(1 - 4*x)) / (2*x);

spec := [ A, {A=Prod(Z, Sequence(A))}, unlabeled ]: [ seq(combstruct[count](spec, size=n), n=0..42) ];

with(combstruct):bin := {B=Union(Z, Prod(B, B))}: seq (count([B, bin, unlabeled], size=n), n=1..25); # Zerinvary Lajos, Dec 05 2007

Z[0]:=0: for k to 42 do Z[k]:=simplify(1/(1-z*Z[k-1])) od: g:=sum((Z[j]-Z[j-1]), j=1..42): gser:=series(g, z=0, 42): seq(coeff(gser, z, n), n=0..41); # Zerinvary Lajos, May 21 2008


A000108[ n_ ] := (2 n)!/n!/(n+1)!

A000108[n_] := Hypergeometric2F1[1 - n, -n, 2, 1] (* Richard L. Ollerton, Sep 13 2006 *)

Table[ CatalanNumber@ n, {n, 0, 24}] (* Robert G. Wilson v, Feb 15 2011 *)

CoefficientList[InverseSeries[Series[x/Sum[x^n, {n, 0, 31}], {x, 0, 31}]]/x, x](* Mats Granvik, Nov 24 2013 *)


(MAGMA) C:= func< n | Binomial(2*n, n)/(n+1) >; [ C(n) : n in [0..60]];

(PARI) a(n)=binomial(2*n, n)/(n+1) \\ M. F. Hasler, Aug 25 2012

(PARI) a(n)=if(n<0, 0, (2*n)!/n!/(n+1)!)

(PARI) a(n)=local(A, m); if(n<0, 0, m=1; A=1+x+O(x^2); while(m<=n, m*=2; A=sqrt(subst(A, x, 4*x^2)); A+=(A-1)/(2*x*A)); polcoeff(A, n))

(PARI) {a(n) = if( n<1, n==0, polcoeff( serreverse( x / (1 + x)^2 + x * O(x^n)), n))}; /* Michael Somos */

(PARI) recur(a, b)=if(b<=2, (a==2)+(a==b)+(a!=b)*(1+a/2), (1+a/b)*recur(a, b-1));

a(n)=recur(n, n); \\ R. J. Cano, Nov 22 2012

(Mupad) combinat::dyckWords::count(n) $ n = 0..38 // Zerinvary Lajos, Apr 14 2007

(Sage) [catalan_number(i) for i in range(27)] # Zerinvary Lajos, Jun 26 2008

(Sage) [binomial(2*i, i)-binomial(2*i, i-1) for i in xrange(0, 25)] # Zerinvary Lajos, May 17 2009

(MAGMA) [Catalan(n): n in [0..40]]; // Vincenzo Librandi, Apr 02 2011


import Data.List (genericIndex)

a000108 n = genericIndex a000108_list n

a000108_list = 1 : catalan [1] where

   catalan cs = c : catalan (c:cs) where

      c = sum $ zipWith (*) cs $ reverse cs

-- Reinhard Zumkeller, Nov 12 2011

(Sage) # Generalized algorithm of L. Seidel

def A000108_list(n) :

    D = [0]*(n+1); D[1] = 1

    b = True; h = 1; R = []

    for i in range(2*n-1) :

        if b :

            for k in range(h, 0, -1) : D[k] += D[k-1]

            h += 1; R.append(D[1])

        else :

            for k in range(1, h, 1) : D[k] += D[k+1]

        b = not b

    return R

A000108_list(31) # Peter Luschny, Jun 02 2012

(Maxima) A000108(n):=binomial(2*n, n)/(n+1)$ makelist(A000108(n), n, 0, 30); [Martin Ettl, Oct 24 2012]


Cf. A000984, A002420, A048990, A024492, A000142, A022553, A039599, A003046, A069640, A094216, A094638, A014137, A014138, A094639, A099731, A008549, A008276, A094638, (|A008276|), A094216, A094639, A000984, A000245, A002057, A000344, A003517, A000588, A003518, A003519, A001392, A124926, A098597, A086117, A137697, A000957, A068875, A032443, A179277, A154559, A059288, A129763, A003046, A032357, A014140, A120304, A211611, A119822, A129763, A167892, A167893, A161581, A006480, A001791.

A row of A060854.

See A001003, A001190, A001699, A000081 for other ways to count parentheses.

Enumerates objects encoded by A014486.

A diagonal of any of the essentially equivalent arrays A009766, A030237, A033184, A059365, A099039, A106566, A130020, A047072.

Cf. A051168 (diagonal of the square array described).

Cf. A033552, A176137 (partitions into Catalan numbers).

Cf. A000753, A000736 (Boustrophedon transforms).

Cf. A120303 (largest prime factor of Catalan number).

Cf. A121839 (reciprocal Catalan constant).

Cf. A038003, A119861, A119908, A120274, A120275 (odd Catalan number).

Cf. A002390 (decimal expansion of natural logarithm of golden ratio).

Sequence in context: A115140 A120588 A168491 * A057413 A126567 A125501

Adjacent sequences:  A000105 A000106 A000107 * A000109 A000110 A000111




N. J. A. Sloane



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

Content is available under The OEIS End-User License Agreement .

Last modified April 19 14:44 EDT 2014. Contains 240761 sequences.