|
Search: id:A003453
|
|
|
| A003453 |
|
Number of dissections of a polygon.
(Formerly M2542)
|
|
+0
2
|
|
| 1, 3, 6, 11, 17, 26, 36, 50, 65, 85, 106, 133, 161, 196, 232, 276, 321, 375, 430, 495, 561, 638, 716, 806, 897, 1001, 1106, 1225, 1345, 1480, 1616, 1768, 1921, 2091, 2262, 2451, 2641, 2850, 3060, 3290, 3521, 3773, 4026
(list; graph; listen)
|
|
|
OFFSET
|
5,2
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
P. Lisonek, Closed forms for the number of polygon dissections. Journal of Symbolic Computation 20 (1995), 595-601.
Petr Lisonek, Combinatorial families enumerated by quasi-polynomials, Journal of Combinatorial Theory, Series A, Volume 114, Issue 4, May 2007, Pages 619-630.
R. C. Read, On general dissections of a polygon, Aequat. Math. 18 (1978), 370-388.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=5..1000
N. J. A. Sloane, Transforms
|
|
FORMULA
|
G.f.: (1+x-x^2) / ((1-x)^4*(1+x)^2).
|
|
CROSSREFS
|
John Layman (layman(AT)calvin.math.vt.edu) observes that this appears to be the alternating sum transform (PSumSIGN) of A005744.
Cf. A005744.
Sequence in context: A119639 A107957 A000603 this_sequence A011901 A109471 A124454
Adjacent sequences: A003450 A003451 A003452 this_sequence A003454 A003455 A003456
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)
|
|
|
Search completed in 0.002 seconds
|
