login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002058 Number of partitions of a n-gon into (n-3) parts.
(Formerly M2069 N0817)
3
2, 14, 72, 330, 1430, 6006, 24752, 100776, 406980, 1634380, 6537520, 26075790, 103791870, 412506150, 1637618400, 6495886320, 25751549340, 102042235620, 404225281200, 1600944863700, 6339741660252, 25103519174844, 99399793096352 (list; graph; refs; listen; history; internal format)
OFFSET

5,1

COMMENTS

First subdiagonal of the table of V(r,k) on page 240. The values V(11,8) = 24052, V(13,10)= 396800 and V(15,12)= 6547520 of the publication are replaced/corrected in the sequence.

REFERENCES

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).

LINKS

A. Cayley, On the partitions of a polygon, Proc. London Math. Soc., 22 (1891), 237-262

A. Cayley, On the partitions of a polygon, Collected Mathematical Papers. Vols. 1-13, Cambridge Univ. Press, London, 1889-1897, Vol. 13, pp. 93ff.

FORMULA

a(n) = 2 binomial(2n-5,n-5). - David Callan (callan(AT)stat.wisc.edu), Mar 30 2007

G.f. 64*x^5/((1+sqrt(1-4x))^5*sqrt(1-4x)). - R. J. Mathar, Nov 27 2011

CROSSREFS

Cf. A002059, A002060.

Sequence in context: A072888 A171012 A094583 * A095933 A189305 A043011

Adjacent sequences:  A002055 A002056 A002057 * A002059 A002060 A002061

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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

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

Last modified February 13 08:12 EST 2012. Contains 205451 sequences.