Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A002058
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A002058 Number of partitions of a polygon by number of parts.
(Formerly M2069 N0817)
+0
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; listen)
OFFSET

5,1

REFERENCES

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.

LINKS

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

CROSSREFS

Cf. A002059, A002060.

Sequence in context: A086243 A072888 A094583 this_sequence A095933 A043011 A138156

Adjacent sequences: A002055 A002056 A002057 this_sequence A002059 A002060 A002061

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research