The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A007160 Number of diagonal dissections of a convex (n+6)-gon into n regions. (Formerly M5094) 5
 1, 20, 225, 1925, 14014, 91728, 556920, 3197700, 17587350, 93486536, 483367885, 2442687975, 12109051500, 59053512000, 283963030560, 1348824395160, 6338392712550, 29503515951000, 136173391604250 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Number of standard tableaux of shape (n,n,1,1,1,1) (see Stanley reference). - Emeric Deutsch, May 20 2004 Number of increasing tableaux of shape (n+4,n+4) with largest entry 2n+4. An increasing tableau is a semistandard tableau with strictly increasing rows and columns, such that the set of entries forms an initial segment of the positive integers. - Oliver Pechenik, May 02 2014 a(n) = number of noncrossing partitions of 2n+4 into n blocks all of size at least 2. - Oliver Pechenik, May 02 2014 REFERENCES N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..150 D. Beckwith, Legendre polynomials and polygon dissections?, Amer. Math. Monthly, 105 (1998), 256-257. P. Lisonek, Closed forms for the number of polygon dissections, Journal of Symbolic Computation 20 (1995), 595-601. O. Pechenik, Cyclic sieving of increasing tableaux and small Schröder paths, arXiv:1209.1355 [math.CO]. O. Pechenik, Cyclic sieving of increasing tableaux and small Schröder paths, J. Combin. Theory A, 125 (2014), 357-378. Ronald C. Read, On general dissections of a polygon, Aequat. math. 18 (1978) 370-388, Table 1. R. P. Stanley, Polygon dissections and standard Young tableaux, J. Comb. Theory, Ser. A, 76, 175-177, 1996. FORMULA D-finite with recurrence (n+5)(n-1)*n*a(n) = 2(2n+3)(n+3)(n+2)a(n-1). a(n) = binomial(n+3, 4)*binomial(2n+4, n-1)/n. MATHEMATICA a[n_] := (n+1)(n+2)(n+3)*Binomial[2n+4, n-1]/24; Table[a[n], {n, 1, 19}](* Jean-François Alcover, Nov 16 2011 *) PROG (Magma) [Binomial(n+3, 4)*Binomial(2*n+4, n-1)/n : n in [1..30]]; // Vincenzo Librandi, Nov 17 2011 CROSSREFS A diagonal of A033282. Sequence in context: A178261 A054329 A112503 * A195265 A321674 A264876 Adjacent sequences: A007157 A007158 A007159 * A007161 A007162 A007163 KEYWORD easy,nonn,nice AUTHOR N. J. A. Sloane EXTENSIONS Offset is correct! STATUS approved

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

Last modified May 17 19:32 EDT 2024. Contains 372603 sequences. (Running on oeis4.)