|
Search: id:A005037
|
|
|
| A005037 |
|
Number of ways of dissecting a polygon into n pentagons.
(Formerly M4236)
|
|
+0
1
|
|
| 1, 1, 6, 40, 285, 2126, 16380, 129456, 1043460, 8544965, 70893054, 594610536, 5033644070, 42952562100, 369061673400, 3190379997272, 27727712947836
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
F. Harary, E. M. Palmer and R. C. Read, On the cell-growth problem for arbitrary polygons, Discr. Math. 11 (1975), 371-389.
|
|
CROSSREFS
|
Sequence in context: A122471 A090041 A069720 this_sequence A081337 A138240 A083805
Adjacent sequences: A005034 A005035 A005036 this_sequence A005038 A005039 A005040
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
