This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A049124 Revert transform of (-1 + x + x^2)/((x - 1)*(x + 1)). 14
 1, 1, 2, 6, 20, 71, 264, 1015, 4002, 16094, 65758, 272208, 1139182, 4811807, 20487096, 87832558, 378846620, 1642851797, 7158220968, 31323340342, 137595355130, 606533278416, 2682157911032, 11895267124841, 52895679368820, 235792891885786, 1053475824902774 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS a(n) is the number of ways to dissect convex (n+2)-gon with non-crossing diagonals so that no 2m-gons (m > 1) appear. - Len Smiley Number of even trees (i.e., ordered trees in which all nodes have even outdegree) with n+1 leaves. - Emeric Deutsch, Mar 06 2002 a(n) is the number of permutations on [n-1] in which the last 2 entries of each 321 pattern are adjacent in position. For example, a(5)=20 counts all permutations on  except 3241, 4231, 4312, 4321, the first, for instance because the 2 and 1 are not adjacent. - David Callan, Jul 20 2005 a(n) is the number of directed diagonally convex polyominoes with perimeter 2*n (this holds for every n > 1). - Svjetlan Feretic, Jul 11 2016 From Colin Defant, Sep 17 2018: (Start) Let L(u,v) be the set of integer partitions whose Young diagrams fit inside a u by v rectangle. Given lambda in L(u,v), let E(lambda) be the number of partitions whose Young diagrams fit inside the Young diagram of lambda. Also, for 1 <= i <= v, let x_i(lambda)-1 be the number of parts of lambda of length v+1-i. Let x_{v+1}(lambda) = u+v+1-Sum_{i=1..v} x_i(lambda) so that (x_1(lambda),..., x_{v+1}(lambda)) is a composition of u+v+1 into v+1 parts. Let F(lambda) = Prod_{i=1..v+1} Catalan(x_i(lambda)). We have a(n) = Sum_{k=0..n-2} Sum_{lambda in L(n-2k-2)} E(lambda) * F(lambda). a(n) is the number of permutations of [n-1] that avoid the patterns 2341, 3241, 3412, and 3421. a(n) is the number of permutations pi of [n-1] such that s(pi) avoids the patterns 231, 312, and 321, where s is West's stack-sorting map. (End) LINKS Alois P. Heinz, Table of n, a(n) for n = 0..1000 Paul Barry, Riordan arrays, generalized Narayana triangles, and series reversion, Linear Algebra and its Applications, 491 (2016) 343-385. D. Birmajer, J. B. Gil, M. D. Weiner, Colored partitions of a convex polygon by noncrossing diagonals, arXiv preprint arXiv:1503.05242 [math.CO], 2015. Colin Defant, Stack-sorting preimages of permutation classes, arXiv:1809.03123 [math.CO], 2018. S. Feretic and D. Svrtan, Combinatorics of diagonally convex directed polyominoes, Discrete Math. 157 (1996), 147-168. Alice L. L. Gao, Sergey Kitaev, On partially ordered patterns of length 4 and 5 in permutations, arXiv:1903.08946 [math.CO], 2019. Nancy S. S. Gu, Nelson Y. Li, and Toufik Mansour, 2-Binary trees: bijections and related issues, Discr. Math., 308 (2008), 1209-1221. L. Smiley, Even-gon reference L. Smiley, Variants of Schroeder Dissections, arXiv:math/9907057 [math.CO], 1999. FORMULA G.f. satisfies: A(x) = x + A(x)^2/(1-A(x)^2); by Lagrange Inversion: A(x) = x + Sum_{n>=0} d^n/dx^n (x^2/(1-x^2))^(n+1)/(n+1)!, or: A(x) = Sum_{n>=0} Sum_{k>=n} C(k-1, k-n)*(2*k)!/(2*k-n+1)!*x^(2*k-n+1)/n!. - Paul D. Hanna, Mar 24 2004 a(n) = Sum_{k=0..floor((n-1)/2)} C(n-k-1, k)*C(2*n-2*k, n)/(n+1) for n > 0, with a(0)=1. - Paul D. Hanna, Dec 15 2004 Recurrence: 5*n*(n+1)*(91*n^2 - 367*n + 348)*a(n) = 12*n*(182*n^3 - 825*n^2 + 1053*n - 328)*a(n-1) - 4*(91*n^4 - 549*n^3 + 971*n^2 - 453*n - 108)*a(n-2) + 6*(n-3)*(182*n^3 - 825*n^2 + 1092*n - 384)*a(n-3) - 4*(n-4)*(n-3)*(91*n^2 - 185*n + 72)*a(n-4). - Vaclav Kotesovec, Jul 29 2013 Lim_{n->infinity} a(n)^(1/n) = z, where z = 4.730576939379622... is the root of the equation 4 - 12*z + 4*z^2 - 24*z^3 + 5*z^4 = 0. - Vaclav Kotesovec, Jul 29 2013 EXAMPLE a(2)=2 because one diagonal may be placed 2 ways in the quadrilateral (placing none is not allowed). Generated from Fibonacci polynomials (A011973) and odd self-convolutions of Catalan numbers (A039599): a(0) = 1*   1 = 1. a(1) = 1*   1 = 1. a(2) = 1*   2 + 0*   1/3 = 2. a(3) = 1*   5 + 1*   3/3 = 6. a(4) = 1*  14 + 2*   9/3 +  0*  1/5 = 20. a(5) = 1*  42 + 3*  28/3 +  1*  5/5 = 71. a(6) = 1* 132 + 4*  90/3 +  3* 20/5 + 0* 1/7 = 264. a(7) = 1* 429 + 5* 297/3 +  6* 75/5 + 1* 7/7 = 1015. a(8) = 1*1430 + 6*1001/3 + 10*275/5 + 4*35/7 + 0*1/9 = 4002. This process is equivalent to the formula: a(n) = Sum_{k=0..floor((n-1)/2)} C(n-k-1,n-2k-1)*C(2n-2k,n-2k)/(n+1). The odd self-convolutions of Catalan numbers begin: A000108^1: {1, 1,  2,  5,  14,  42,  132, 329, 1430, ...} A000108^3: {1, 3,  9, 28,  90, 297, 1001, ...} A000108^5: {1, 5, 20, 75, 275, ...} A000108^7: {1, 7, 35, ...} MAPLE Order := 20; solve(series((A-A^2-A^3)/(1-A^2), A)=x, A); MATHEMATICA a[n_] := (2^n*(2n-1)!!* HypergeometricPFQ[{1/2-n/2, 1/2-n/2, 1-n/2, -n/2}, {1/2-n, 1-n, -n}, -4])/(n! + n*n!); Table[a[n], {n, 0, 24}] (* Jean-François Alcover, Jul 25 2011, after Paul D. Hanna *) PROG (PARI) {a(n)=polcoeff(sum(m=0, n, sum(k=0, n, binomial(k+m-1, k)*binomial(2*k+2*m, m)*x^(2*k+m+1)/(2*k+m+1))), n)} (PARI) {a(n)=if(n==0, 1, sum(k=0, (n-1)\2, binomial(n-k-1, k)*binomial(2*n-2*k, n))/(n+1))} \\ Paul D. Hanna, Dec 15 2004 CROSSREFS Cf. A000108, A003168, A269228. Row sums of A319120. Sequence in context: A274484 A128729 A006027 * A275756 A301627 A163134 Adjacent sequences:  A049121 A049122 A049123 * A049125 A049126 A049127 KEYWORD nonn,easy,nice AUTHOR EXTENSIONS More terms from Paul D. Hanna, Dec 15 2004 STATUS approved

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

Last modified October 18 22:21 EDT 2019. Contains 328211 sequences. (Running on oeis4.)