|
Search: id:A005036
|
|
|
| A005036 |
|
Number of ways of dissecting a polygon into n quadrilaterals.
(Formerly M1491)
|
|
+0
2
|
|
| 1, 1, 2, 5, 16, 60, 261, 1243, 6257, 32721, 175760, 963900, 5374400, 30385256, 173837631, 1004867079, 5861610475, 34469014515, 204161960310, 1217145238485, 7299007647552, 44005602441840
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
F. Harary, E. M. Palmer and R. C. Read, On the cell-growth problem for arbitrary polygons, Discr. Math. 11 (1975), 371-389.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n = 1..100
E. V. Konstantinova, A survey of the cell-growth problem and some its variations, Com 2 MaC-KOSEF, 2001.
Index entries for "core" sequences
|
|
MATHEMATICA
|
p=4; Table[(Binomial[(p-1)n, n]/(((p-2)n+1)((p-2)n+2)) + If[OddQ[n], If[OddQ[p], Binomial[(p-1)n/2, (n-1)/2]/n, (p+1)Binomial[((p-1)n-1)/2, (n-1)/2]/((p-2)n+2)], 3Binomial[(p-1)n/2, n/2]/((p-2)n+2)]+Plus @@ Map[EulerPhi[ # ]Binomial[((p-1)n+1)/#, (n-1)/# ]/((p-1)n+1)&, Complement[Divisors[GCD[p, n-1]], {1, 2}]])/2, {n, 1, 20}] - Robert A. Russell (russell(AT)post.harvard.edu), Dec 11 2004
|
|
CROSSREFS
|
Cf. A005419, A004127, A005038, A005040, A000207.
Sequence in context: A059237 A104547 A000764 this_sequence A012051 A012159 A009736
Adjacent sequences: A005033 A005034 A005035 this_sequence A005037 A005038 A005039
|
|
KEYWORD
|
core,nonn,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Oct 13 2001
|
|
|
Search completed in 0.002 seconds
|
