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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003451 Number of dissections of a polygon.
(Formerly M3330)
2
1, 4, 8, 16, 25, 40, 56, 80, 105, 140, 176, 224, 273, 336, 400, 480, 561, 660, 760, 880, 1001, 1144, 1288, 1456, 1625, 1820, 2016, 2240, 2465, 2720, 2976, 3264, 3553, 3876, 4200, 4560, 4921, 5320, 5720, 6160, 6601, 7084, 7568, 8096, 8625, 9200, 9776, 10400 (list; graph; refs; listen; history; internal format)
OFFSET

5,2

COMMENTS

a(n)=A006584(n+3)-A027656(n) - Yosu Yurramendi (yosu.yurramendi(AT)ehu.es), Aug 07 2008

REFERENCES

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.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

FORMULA

G.f.: (1 + 2x - x^2 ) / (1 - x)^4 (1 + x)^2.

CROSSREFS

Cf. A006584, A027656.

Sequence in context: A161226 A022560 A193452 * A013934 A167189 A050470

Adjacent sequences:  A003448 A003449 A003450 * A003452 A003453 A003454

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 15 13:49 EST 2012. Contains 205810 sequences.