Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A002056
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A002056 Number of diagonal dissections of a convex n-gon into n-5 regions.
(Formerly M4941 N2115)
+0
5
1, 14, 120, 825, 5005, 28028, 148512, 755820, 3730650, 17978180, 84987760, 395482815, 1816357725, 8250123000, 37119350400, 165645101160, 733919156190, 3231337461300, 14147884842000, 61636377252450 (list; graph; listen)
OFFSET

6,2

COMMENT

Number of standard tableaux of shape (n-5,n-5,1,1,1) (see Stanley reference). - Emeric Deutsch (deutsch(AT)duke.poly.edu), May 20 2004

REFERENCES

D. Beckwith, Legendre polynomials and polygon dissections?, Amer. Math. Monthly, 105 (1998), 256-257.

A. Cayley, On the partitions of a polygon, Proc. London Math. Soc., 22 (1891), 237-262 = Collected Mathematical Papers. Vols. 1-13, Cambridge Univ. Press, London, 1889-1897, Vol. 13, pp. 93ff.

P. Lisonek, Closed forms for the number of polygon dissections. Journal of Symbolic Computation 20 (1995), 595-601.

R. C. Read, On general dissections of a polygon, Aequat. Math. 18 (1978), 370-388.

R. P. Stanley, Polygon dissections and standard Young tableaux, J. Comb. Theory, Ser. A, 76, 175-177, 1996.

LINKS

T. D. Noe, Table of n, a(n) for n=6..100

FORMULA

a(n)=binomial(n-3, 3)*binomial(2n-7, n-6)/(n-5).

CROSSREFS

Sequence in context: A073383 A022642 A004312 this_sequence A125377 A126535 A041001

Adjacent sequences: A002053 A002054 A002055 this_sequence A002057 A002058 A002059

KEYWORD

nonn

AUTHOR

njas

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 7 23:08 EDT 2008. Contains 143486 sequences.


AT&T Labs Research